Twitter | Pretraživanje | |
-_- 17. sij
Odgovor korisniku/ci @GabrielG439
You write the phrase '“total” (i.e. not Turing-complete)'. This is quite misleading; if by Turing complete you mean the language can implement a Turing machine then totality does not forbid Turing completeness as McBride explains here:
Reply Retweet Označi sa "sviđa mi se"
Gabriel Gonzalez 17. sij
Odgovor korisniku/ci @boarders__
Usually I understand "Turing-complete" to mean that the language can not only implement but also run the Turing-machine
Reply Retweet Označi sa "sviđa mi se"