Differences between version 5 and revision by previous author of FiniteStateMachine.
Other diffs: Previous Major Revision, Previous Revision, or view the Annotated Edit History
| Newer page: | version 5 | Last edited on Friday, October 24, 2003 11:46:35 am | by StuartYeates | Revert |
| Older page: | version 4 | Last edited on Friday, October 24, 2003 10:41:41 am | by PerryLorier | Revert |
@@ -1 +1,3 @@
A conceptual model of a computer (or a computer program) which represents the conputation in terms of a finite number of states and transitions between them. This is the closest commonly used paradigm to both the [TuringMachine] and JohnVonNeumann's automata, and is widely used in parsers. Often implemented with the much-maligned [GoTo].
+
+One of the fundamental proofs in ComputerScience is that any result calculatable on a FiniteStateMachine is calculatable in LambdaCalculus.
