Differences between version 2 and predecessor to the previous major change of TuringMachine.
Other diffs: Previous Revision, Previous Author, or view the Annotated Edit History
Newer page: | version 2 | Last edited on Wednesday, November 27, 2002 4:38:46 pm | by DanielLawson | Revert |
Older page: | version 1 | Last edited on Wednesday, November 27, 2002 4:34:06 pm | by DanielLawson | Revert |
@@ -2,4 +2,9 @@
A Turing machine, therefore, is more like a computer program (software) than a computer (hardware). Any given Turing machine can be realized or implemented on an infinite number of different physical computing devices. Computer scientists and logicians have shown that Turing machines -- given enough time and tape -- can compute any function that any conventional digital computers can compute. Also, a ‘probabilistic automaton’ can be defined as a Turing machine in which the transition from input and state to output and state takes place with a certain probability (E.g. "If in State 1 scanning a 0: (a) there is a 60% probability that the machine will print 1, move left, and go into State 3, and (b) there is a 40% probability that the machine will print 0, move left, and go into State 2".)
http://plato.stanford.edu/entries/turing-machine/
+
+Some neat? implementations of a TuringMachine are:
+
+SendmailTuringMachine
+EximTuringMachine