Hacker News new | ask | show | jobs
by tromp 512 days ago
Non-deterministic Turing machines [1] are the standard way to define Non-deterministic complexity classes like NP or NEXP, so there are definitely Turing machines with indeterminacy.

[1] https://en.wikipedia.org/wiki/Nondeterministic_Turing_machin...