Linked by Thom Holwerda on Fri 22nd Jun 2012 08:30 UTC
Thread beginning with comment 523403
To view parent comment, click here.
To read all comments associated with this story, please click here.
To view parent comment, click here.
To read all comments associated with this story, please click here.
Features
Linked by Thom Holwerda on 05/18/13 21:33 UTC
Linked by David Adams on 05/16/13 4:23 UTC
Linked by Thom Holwerda on 05/11/13 21:41 UTC
Linked by Thom Holwerda on 05/08/13 14:22 UTC
Linked by Thom Holwerda on 05/02/13 15:28 UTC
Linked by Thom Holwerda on 04/29/13 21:06 UTC
Linked by Thom Holwerda on 04/24/13 22:24 UTC
Linked by Thom Holwerda on 04/18/13 11:21 UTC
Linked by Thom Holwerda on 04/16/13 9:29 UTC
Linked by Thom Holwerda on 04/15/13 22:44 UTC
More Features »
Sponsored Links



Member since:
2006-01-25
According to Stephen Wolfram, you can make a machine with a single head, only 2 independent states, and 3 symbols (i.e. trinary bits) that is Turing Complete.
http://en.wikipedia.org/wiki/Wolfram's_2-state_3-symbol_Turing_machine
I know that you weren't being literal... I just thought it was interesting how simple a Turing Complete machine can actually be.