4 Commits

Author	SHA1	Message	Date
arushs	0f4891f991	Important as it shows with formal proofs how to classify sequences into different levels of difficulty based on computability	2014-09-02 23:03:51 -07:00
Darren_N	b16225016d	Update README.md	2014-06-09 20:38:20 -04:00
chaddcw	e0ba07d4ed	Mealy machines paper ... Add Mealy's paper describing Mealy Machines	2014-03-19 10:00:30 -07:00
chaddcw	8950281574	Turing's 1936 paper ... Add Turing's 1936 paper outlining Turing Machines	2014-03-19 09:57:21 -07:00