2014-06-28
		01:17 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 . . .**

History of notes-computer-turingMachineEquivalentsList