I just can’t understand no matter how much I google it.
In: 6
Turing completeness is, basically, “can compute anything you can write an algorithm for, given enough time”. Or, more simply, “can run an emulator of a turing machine, so anything a turing machine can compute, so can the thing”.
Latest Answers