We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Talk:Daft
Jump to navigation
Jump to search
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)