Turing Compliant?
Paul Prescod
paul at prescod.net
Sat Sep 4 19:11:03 EDT 1999
C.Laurence Gonsalves wrote:
>
> Actually, there are programming languages that are not Turing complete.
I claim that Turing completeness is the only useful (or at least
quasi-useful) definition of programming language that we have. If we
accept that a programming language could be non-complete then how do we
fend off the Barbarians that call HTML a programming language?
Paul Prescod
More information about the Python-list
mailing list