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:Tableaux
Jump to navigation
Jump to search
Computational power?
It has already been demonstrated that the language is uncomputable, however this doesn't say whether it's equivalent to a Turing machine with a halting oracle, or something more powerful. I was wondering if this is known. AlephSquirrel (talk) 23:50, 2 August 2026 (UTC)