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: https://personal.cis.strath.ac.uk/conor.mcbride/pub/Totality.pdf …
-
-
-
Usually I understand "Turing-complete" to mean that the language can not only implement but also run the Turing-machine
- Još 8 drugih odgovora
Novi razgovor -
Čini se da učitavanje traje već neko vrijeme.
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.