Show Posts

This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.


Messages - shmibs

Pages: 1 ... 15 16 [17] 18 19 ... 126
241
Miscellaneous / Re: Religion Discussion
« on: May 21, 2013, 02:52:58 pm »
"evolution" is not an attempt at anything. scientists do not study things and pose theories in an attempt to anger people or disprove things. science is an approach to information that tries to make as few assumptions as possible. it takes data as input (via careful experimentation) and proposes generalised rules based upon the results. if, later on, a better method of measurement is discovered or some other critical piece of information that was not considered during the previous experiment, a new one is conducted and a revised generalised rule determined. such experiments are, nowadays, performed by people all over the globe, and they are free to contribute to one another and draw from one another, resulting in more accurate results. the idea is that nothing can be known for certain, but some things can be known with a greater degree of certainty than others, and that's the best we can get.

the theory of evolution is one such generalised rule that happens to be much better supported than most. that we can see evidence of our own evolution all around us (people originating from different regions of the globe have specialised features, i.e. long, straight hair for holding in warmth in northern regions vs. short, curly hair that lays flat against the head in order to keep off the sun), can see clear evidence of directed evolution in the form of pets (particularly dogs. they are the most outwardly diverse species of mammal that i can think of, at any rate), and can literally watch the process occurring in small, rapidly-reproducing creatures under a microscope (take a species of bacteria, for example, introduce something which is toxic to them, and you might end up with millions of dead bacteria along with one or two that were able to survive due to some mutation or other which made them immune. allow those few to reproduce and suddenly you have a group of bacteria that is immune to that toxin on a wide scale) is evidence enough that, to disprove the theory of evolution, one would need to somehow prove life-long visual and auditory hallucinations on a species-wide scale. furthermore, those hallucinations would all have to be practically identical.

this theory has absolutely nothing to do with whether or not your god exists. it is a generalisation about the way that organisms function.

also, lack of evidence is evidence of lack. when you look down at a table, expecting there to be a pen, and do not see your pen, you do not ignore that and reach for the pen anyways. you take it as an indication that the pen is not there, and start searching elsewhere (in your pockets, on the floor, etc)

242
Miscellaneous / Re: Religion Discussion
« on: May 21, 2013, 11:13:13 am »
* shmibs actually agrees

everything is, to some extent, something that has to be believed in. knowing your surroundings requires that you first have faith in the trustworthiness of your senses, knowing mathematical theorems to be correct requires first that you have faith in the work of those who have proven them (or, in the case where you have proven all the necessary prerequisites for some conclusion, faith in yourself :P). for humans, then, "truth" is not an absolute, but rather a degree of certainty.



also, as per the rules, this topic will be watched. feel free to speak your minds, but don't let it turn into a flame war, please.

243
Miscellaneous / Re: My Existential Philosophy
« on: May 20, 2013, 10:09:07 pm »
Are you saying that to convince us that you do exist ? How could we trust in you because you say that you could believe that we don't exist ?

Moreover, how can you be sure that you really exist ? Isn't it an illusion ? As a case in point, AI in computer games have the illusion that they exist, but it is not true.

But AI does not think. It goes by a set of instructions. Even learning AI does not think, and, if it did, how would we know?
Neural networks don't quite "think." Static FFNA's (Feed forward Neural Networks), the standard type in most research, are actually just functions that take inputs and map them to outputs. Only if you accept functionalism and reductive physicalism can you begin to say neural networks can "think" in any capacity. If you also want to say that such a network can be processed by a computer, then you have to drag in the huge overhead of the Church-Turing thesis and throw out all neural networks with irrational edge weights and node states. Unfortunately, with the exception of the Church-Turing thesis, all of these are highly contentious things to present in an argument and it's why neural nets are basically laughed at in most philosophy departments nowadays.

what definition of "think" is being used here? personally, i like to consider any thing which can respond to stimuli, retain information, and modify its responses based upon that information as a "thinking thing", and leave any distinctions beyond that as a matter of degree.

I have five different proofs for why He would have to exist.

please don't bring up aquinas. i had quite enough of him in not-quite-catholic school :P
understand that the following is about aquinas himself and his so-called "proofs" and not me making any statement about whether or not a god exists.

"proof" number one starts with this statement early on:
"Now whatever is in motion is put in motion by another, for nothing can be in motion except it is in potentiality to that towards which it is in motion"
he then follows it up with:
"Therefore it is necessary to arrive at a first mover, put in motion by no other", which is, very obviously, a direct contradiction of his earlier statement. thus, if his logic is to be trusted, what he has actually proven by contradiction is that not all things are put in motion by another, a matter completely unrelated to whether or not a god exists.

number two is a mirror image of his first. he states that "no thing can be the efficient cause of itself", then follows it up with "god is the efficient cause of himself", meaning that, if his logic is to be trusted, some things spontaneously come into existence without any outside influences. again, this is unrelated to whether or not a god exists.

the third begins with the un-backed claim that all things cease to exist (which flies directly in the face of the classical idea of conservation of energy), then an un-backed claim that the default state of any thing which can cease to exist is necessarily nothingness (his first claim that all things must go from existence to non-existence is unrelated to the claim that all things must come *from* non-existence into existence [incidentally, there is some evidence that particles can, in fact, come into existence spontaneously]). his last statement is a repetition of the last line of the previous two, "there must, necessarily, be some thing which has always existed and caused other things to exist", a statement completely unrelated to the rest of this current "proof". he then jumps to the conclusion that, because "something" exists, that "something" must necessarily be his God (by the way, he did this exact same thing in the previous two).

the fourth is even sillier than the others (he makes the statement that fire is the cause of all things that are hot, for one, but that's neither here nor there as it's just an analogy). he begins with the statement that any one thing can either be more or less x than another thing, where x is some quality. he then says that this judgement is always made in relation to some absolute which is "most" x. this assumption is not only un-backed, but counter-intuitive. more and less are used to compare two things to one another. it makes no sense to say that any one thing is "the epitomy" of x. one could say that a single thing is the most "x" in existence (i.e., nothing before has ever reached such a degree of "x". there has never been a material which was as hot as this one is currently, for example). however, for any such thing that has a clearly-defined denotation of "more" or "less", it is possible to continue imagining something which is "more" ad infinitum, just as it is always possible to imagine a number larger or smaller than any given number. there is no ultimately hot, big, small, etc thing or anything else which can be applied to a discernible level of degree in that way. he then goes on to apply his assumption to something completely different: "goodness", a thing which does not exist on a clearly defined plane because it has no clear definition. just like other subjective qualities (beauty, for example, which, as the adage says, is in the eyes of the beholder), there is no one definition of what is "better or worse" in the same way as there is for what is "faster and slower" or "bigger and smaller". lastly, he wraps things up with two baseless claims, firstly jumping from the assertion that "every single category which is related to the concept of 'goodness' has something or other as its uppermost echelon" to "every single category which is related to the concept of 'goodness' has a single thing as its uppermost echelon", and then stating that "that single thing must necessarily be my God".

his fifth argument is a bit incoherent, so i've never been sure if i understood it quite right. it seems like he is trying to say that "any thing which reacts in a predictable manner cannot do so without an intelligent thought directing it to do so", which makes no sense at all.

244
Miscellaneous / Re: Language Construction!
« on: May 16, 2013, 12:02:44 pm »
for programming languages, if you want to learn how to make your own you're going to have to learn how to write a compiler. all languages other than machine code running on bare metal are compiled. the three options for this are to write a compiler which converts your code directly into machine code (which is very difficult, and becomes exponentially more so if you want it to work on multiple architectures), a compiler which converts your code into some other language, which is then compiled (which is a bit roundabout and messy, so it isn't very popular), or a compiler which converts your code into bytecode that is executed by a virtual machine written in some other language (which is the most widespread method today).

every good compiler needs to have a few basic parts:

-a lexer this converts plain text files into strings of tokens, with associated types (string literal, type identifier, list, etc) which the language uses. there are plenty of dedicated lexers out there that you can easily include directly in a new language. flex is a particularly popular one.

-a parser this takes your now-tokenised source and searches for illegal statements (something like: int "tasty";, for example, if you're writing C). there is a lot of interesting theory behind the best methods of doing this, but again, you'd be best off just using one of the many pre-made parsers out there. bison is a popular one

-a method for organising data elements (symbol table) and recursive statements (syntax tree). this step will be as easy or as difficult as the complexity level of the program you're writing. if you're making a simple, purely functional language you can use whatever structure you want to store your symbol table. even a giant list would do, though you'd probably want to use something like a heap in order to reduce lookup times. the syntax tree does pretty much have to be a tree structure. this is because it breaks code up into a hierarchical structure so that everything afterwards knows the correct order in which to read your source code. if you had the following code, for example:
Code: [Select]
For(A,0,2)
   A→C
   If A=B
      <do foo>
   Else
      <do bar>
   End
End
it might be translated into a pre-order syntax tree like this:
Code: [Select]
          [<rest of program above>]
                      |
                [For loop]
               /     |    \
  [initialiser]   [body]  [increment]
    /                |               \
[0→A]        [If statement]          [A++]
             /            \
    [condition]          [body]
         |              /      \
       [A≤2]       [A→C]         \
                         [two part If statement]
                         /          |          \
                 [condition]   [then part]   [else part]
                      |             |             |
                    [A=B]       [<do foo>]    [<do bar>]
obviously, if you want to work with objects, variable scope, etcetera, this all gets more complicated.

-semantic checking. traverse your tree and find any inconsistencies (like a function that expects two parameters being passed three instead or a statement like "string literal" == integer, where integer is of type int).

-code generation part. if you're writing a simple, functional language, this part is really easy. just directly translate your now, organised program into its counterpart in whatever other language you're using (converting to machine code, some other language, or bytecode for a virtual machine), looking up variables in your symbol table as you encounter them while traversing the syntax tree and inserting references to them in your generated code (direct addresses for machine code or a virtual machine or names if you're translating to some other language).

-code optimisation part. scan over your generated code and apply any optimisations you can find. obviously, this part isn't necessary, but you will get slow results without it.

245
TI Z80 / Re: Thunderbirds v2.0.0
« on: May 14, 2013, 11:08:41 am »
yay! keep us posted!

246
OTcalc / Re: OTZ80 - Remember it? :D
« on: April 19, 2013, 10:18:27 pm »
NECROPOST, MY FRANNS!
I'm somebody who takes interest in this stuff.
I could find uses for an SD card capable, Wifi using, super calculator. I'd design it for Debian ARM or something.
Where did this project ever go?

please don't necropost, particularly when you know full well that you are doing so and even shout it within said post.

247
The Axe Parser Project / Re: USBpad8x: USB keyboard axiom
« on: April 14, 2013, 03:05:29 am »
dj, if it lets you send arbitrary keypresses, then all you have to do is write a small program that detects a certain button being pressed on the calc and sends the related keybinding for the emulator, right?
* shmibs goes to try it out.
this sounds absolutely fantastic, by the way =DD

EDIT: you should really use a loop and a couple of lists in that example program instead of writing
Code: [Select]
getKey(blah)??bloo->{A++}{over and over :P

248
Computer Projects and Ideas / Re: Popover Web [OS X]
« on: April 13, 2013, 04:31:18 pm »
probably the latter. we tend to not bring in many apple users.

249
Miscellaneous / Re: Post your desktop
« on: April 12, 2013, 06:29:40 pm »
here you go!
(it's rather huge)

250
Miscellaneous / Re: Post your desktop
« on: April 11, 2013, 11:46:05 pm »
mononoke is so coooooolourful =D

251
TI Z80 / Re: tok8x: a very simple on-computer tokeniser/detokeniser
« on: April 11, 2013, 11:06:59 pm »
this isn't an editor; it's just a tool for converting between file formats. someone could build an editor that uses it as a backend, though.

i added an include preprocessor directive! the format is:
##include path/to/file
and the contents of file will be inserted verbatim into the file at that point.

252
TI Z80 / Re: tok8x: a very simple on-computer tokeniser/detokeniser
« on: April 10, 2013, 01:25:21 pm »
apart from the preprocessor and another token set option for pretty printing (in case you want to display "λ" rather than "lambda", etc), i'm fairly certain this is done!

new stuff:
* full pipeline support, so things like
Code: [Select]
cat <some.8xp> | tok8x | grep -n <search term>are perfectly valid =D

* an option to strip excess whitespace (outside of strings) and comments (the format of which is specific to the language) from a generated program, so a file containing:
Code: [Select]
.ABCD
"hey there! i'm a string"->Str1

.one line comment

...
multiple
line
comment
...

For(A,0,23)
Text(0,A*6,{Str1+A})
End
run through:
Code: [Select]
tok8x -s -t axe -i <infile> | tok8x -t axewould generate:
Code: [Select]
.ABCD
"hey there! i'm a string"->Str1
For(A,0,23)
Text(0,A*6,{Str1+A})
End

* searching for individual tokens matching strings on the command line (so something like
Code: [Select]
tok8x Get azvd DiagnosticOffwould return:
Code: [Select]
"Get":Axe:E8
"DiagnosticOff":BASIC:BB67

* expanding leading spaces on a line to tabs for easier reading when converting from an 8xp

253
TI Z80 / Re: tok8x: a very simple on-computer tokeniser/detokeniser
« on: April 08, 2013, 05:01:39 pm »
coolio, i'll take a look at that, then =). the rest of your xml files have already been a big help, by the way.

as for adding in support for xml files, it sounds nice, but i'm still not convinced that it's worth the trouble. at present, all it takes for someone to add in a new token is to write a single line in the form {first_byte, second_byte, "string" }, and then run make. compilation takes less than a second, and the result is a binary that can be dragged and dropped anywhere without the need of additional files, whereas adding in xml support would increase the size considerably and either require me to include some non-standard library or write a lot more code.

EDIT: both the default BASIC and Axe token sets are now complete =D

254
TI Z80 / Re: tok8x: a very simple on-computer tokeniser/detokeniser
« on: April 08, 2013, 04:40:38 am »
i just changed the storage format for other libraries so that they only need to list tokens that are changed from the main token set (like >Char instead of >Frac), so that should make maintenance a much simpler matter.

also, here's a little thing i thought people might find useful:

255
unfortunately, we cannot support implementing CAS features on a non-CAS model because to do so would be condoning cheating on tests. also, please don't create duplicate topics.

both topics locked

Pages: 1 ... 15 16 [17] 18 19 ... 126