Library/Turing machines/NDTM NDTM · Recursively enumerable guess the last 1 @thethinkmachine·version 1·CC BY 4.0·added 28 Sept 2026 The textbook Nondeterministic Turing Machine example. Open in AutomataStudio More ▾ Open in the desktop app Download the .automaton file Source on GitHub scanguess-la…acc The machine as drawn — 3 states, 4 transitions.