Talk:Daft

Does this really belong to Category:Uncomputable? That's the category of languages which can't be translated into equivalent programs in a Turing-complete language, usually because of devices like halting oracles (Banana Scheme) or time travel (TwoDucks). --Koen (talk) 10:55, 2 October 2013 (UTC)
 * Yes, this language is uncomputable. It contains a halting oracle. Haael (talk) 08:43, 22 October 2013 (UTC)