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:Overload/Turing-completeness proof

From Esolang
Jump to navigation Jump to search

The language you compile to cannot have an arbitrary amount of memory that is accessed. There is no way for a program to have an infinite number of states, and the busy beaver is capped at O(exp(n)) Etalon (talk) 19:42, 1 September 2026 (UTC)

Retrieved from "https://esolangs.org/w/index.php?title=Talk:Overload/Turing-completeness_proof&oldid=192084"