History of lists-turingMachineEquivalents
2011-01-18
11:43 UTC
Revision 1
. . . .
BayleShanks
–
todo. also, for ea. machine, which proofs you need to prove to show it is a universal turing machine * lambda calculus * petri nets see also . . .
![[Home]](http://www.bayleshanks.com/cartoonbayle.png)
