StoryresearchFilter: Information needed on relations between superstar Cambridge dons of the 1930s-1950s. i.e. Russell, Wittgenstein, Turing, Keynes. [more inside]
posted by greytape on May 14, 2008 - 9 answers

Can robots use chopsticks? [more inside]
posted by qbxk on Apr 26, 2007 - 4 answers

What is the absolute minimum number of states required in a Turing Machine (that uses binary tape) for it to be able to serve as a Universal Turing Machine? [more inside]
posted by -harlequin- on May 1, 2005 - 3 answers

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