| dbo:abstract |
Turing Tumble is a game and demonstration of logic gates via mechanical computer. Named after Alan Turing, the game itself can (abstractly) duplicate the processes of any computer whatsoever if the game field itself were sufficiently large. This follows because the game is P-complete by the circuit value problem and PSPACE-complete if an exponential number of marbles are allowed. The device has implications for nanotechnology. The game is advertised as Turing complete; an extension of the game that allows an infinitely large board and infinitely many pieces has been shown to be Turing complete via simulations of both Rule 110 for cellular automata, as well as of Turing machines. Although it resembles a pachinko machine in its aesthetic use of gravity-fed metal balls, it is primarily a teaching device in the fundamentals of logic-computer programming, and as such is an example of gamification. The framing device in the included comic book features an astronaut who must solve sixty increasingly difficult logic problems which illustrate the fundamentals of computer programming. The impetus of the puzzle itself was the frustration of the programmer and chemistry professor Paul Boswell (along with his wife, Alyssa Boswell, a DIY maker), then at the University of Minnesota, at the lack of computing prowess of other scientists which was necessary for their own projects; he was already well known for programming complex games for Texas Instruments computers. They were also inspired by the Digi-Comp II, a precursor from the late 1960s. (en) |
| dbo:wikiPageExternalLink |
https://jessecrossen.github.io/ttsim https://www.turingtumble.com |
| dbo:wikiPageID |
62552105 (xsd:integer) |
| dbo:wikiPageLength |
8061 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID |
1091942590 (xsd:integer) |
| dbo:wikiPageWikiLink |
dbr:American_Specialty_Toy_Retailing_Association dbr:University_of_Minnesota dbr:Nanotechnology dbr:PSPACE-complete dbc:Mechanical_computers dbr:Rule_110 dbr:Logic dbr:Comic_book dbr:Computer_programming dbr:Turing_complete dbr:Mechanical_computer dbr:Game dbr:Gamification dbr:P-complete dbr:Aesthetic dbr:Alan_Turing dbr:DIY dbr:Pachinko dbr:Parents'_Choice_Award dbr:Digi-Comp_II dbr:Framing_device dbr:Logic_gate dbr:Puzzle dbc:Educational_toys dbr:Texas_Instruments dbr:Cellular_automata dbr:Circuit_value_problem dbr:Maker_culture dbr:Turing_machines |
| dbp:cs1Dates |
y (en) |
| dbp:date |
July 2020 (en) |
| dbp:wikiPageUsesTemplate |
dbt:Portal dbt:Reflist dbt:Use_dmy_dates |
| dct:subject |
dbc:Mechanical_computers dbc:Educational_toys |
| rdfs:comment |
Turing Tumble is a game and demonstration of logic gates via mechanical computer. Named after Alan Turing, the game itself can (abstractly) duplicate the processes of any computer whatsoever if the game field itself were sufficiently large. This follows because the game is P-complete by the circuit value problem and PSPACE-complete if an exponential number of marbles are allowed. The device has implications for nanotechnology. (en) |
| rdfs:label |
Turing Tumble (en) |
| owl:sameAs |
wikidata:Turing Tumble https://global.dbpedia.org/id/C9Tkk |
| prov:wasDerivedFrom |
wikipedia-en:Turing_Tumble?oldid=1091942590&ns=0 |
| foaf:isPrimaryTopicOf |
wikipedia-en:Turing_Tumble |
| is dbo:wikiPageWikiLink of |
dbr:Nim dbr:PSPACE-complete dbr:Mechanical_computer dbr:Digi-Comp_I dbr:Digi-Comp_II dbr:WDR_paper_computer |
| is foaf:primaryTopic of |
wikipedia-en:Turing_Tumble |