I always thought "Turing-complete programming language" meant you could write a compiler/interpreter/whatever for that language IN that language, ie. XML is not, XSLT is, C++ is for sure, I guess JavaScript could in a way...
Today I tried to check on that, and
apparently it's much more abstract... or
something... well I don't know for sure.
Was I wrong ? How is a Turing-complete/equivalent language defined ?
posted by XiBe
on Jan 27, 2005 -
27 answers