3 ms·
Because you built it in a series of steps, exactly zero of which introduced any undecidability.
by ncmncm 4y ago
Because you built it in a series of steps, exactly zero of which introduced any undecidability.
- mkleczek 4y agoSee above - there is no reliable procedure (algorithm) that would allow you to build a TM with arbitrary properties (ie. implementing arbitrary requirements).
- SAI_Peregrinus 4y agoPrograms don't have to have Turing-complete behavior. Compilers do, but not every program needs to implement uncomputable behavior on its inputs.
- mkleczek 4y agoActually it's the other way around: In reality most interesting programs accept Turing complete languages - albeit not formally specified :)