Universal Turing Machine | Indreams - Dreams™ companion website

Skip to main content

Javascript disabled. Javascript is required for most of this site, for the best experience please enable it. If this is not the case, the site may have crashed.

A Dreams implementation of the simplest possible universal Turing machine - in other words, this is a model of the simplest possible machine that can solve any computable problem. Thus this constitutes a proof that Dreams itself is Turing complete.

DREAM DETAILS
Last modified: 22^nd July 2020 10:39
First published: 21^st June 2020 17:22
Showcase, Expo
Abstract Computer Maths Turing

DREAM STATS
Played 42 times by 33 dreamers
Played for a total of 47 minutes by the coMmunity
11 thumbs up
Used in 1 creation
2 followersView followers

Oh dear! Your browser is either unsupported or there has been a problem loading the page.