This HTML5 document contains 48 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n16https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n15https://jessecrossen.github.io/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n14https://
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Turing_Tumble
rdfs:label
Turing Tumble
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.
dcterms:subject
dbc:Mechanical_computers dbc:Educational_toys
dbo:wikiPageID
62552105
dbo:wikiPageRevisionID
1091942590
dbo:wikiPageWikiLink
dbr:Texas_Instruments dbr:Rule_110 dbr:Puzzle dbr:Game dbr:Parents'_Choice_Award dbr:Turing_machines dbr:Turing_complete dbr:Alan_Turing dbr:Framing_device dbr:Gamification dbr:Cellular_automata dbr:Circuit_value_problem dbr:Pachinko dbr:Digi-Comp_II dbr:American_Specialty_Toy_Retailing_Association dbr:Nanotechnology dbr:Mechanical_computer dbr:University_of_Minnesota dbr:PSPACE-complete dbr:P-complete dbr:Aesthetic dbr:Logic dbc:Educational_toys dbr:Comic_book dbr:Logic_gate dbr:Computer_programming dbr:DIY dbc:Mechanical_computers dbr:Maker_culture
dbo:wikiPageExternalLink
n14:www.turingtumble.com n15:ttsim
owl:sameAs
wikidata:Q85811120 n16:C9Tkk
dbp:wikiPageUsesTemplate
dbt:Use_dmy_dates dbt:Reflist dbt:Portal
dbp:cs1Dates
y
dbp:date
July 2020
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.
prov:wasDerivedFrom
wikipedia-en:Turing_Tumble?oldid=1091942590&ns=0
dbo:wikiPageLength
8061
foaf:isPrimaryTopicOf
wikipedia-en:Turing_Tumble