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:UCL
Jump to navigation
Jump to search
Chaitin's constant is not a single number. Rather, for any Turing-complete subset of any computable language, Chaitin's constant is the measure of the subset; it's the probability that a randomly-chosen member of the computable language is also an element of that subset. Corbin (talk) 12:33, 24 August 2026 (UTC)
- Fixed --None1 (Nope.) 12:47, 24 August 2026 (UTC)
- Not fixed enough. There's implementation-dependent stuff in brainfuck which affects the constant. Consider the program
+[+]. Does it halt? It depends on cell size and value wrapping. It may halt with one brainfuck interpreter and loop forever in another. --Blashyrkh (talk) 13:04, 24 August 2026 (UTC)
- Not fixed enough. There's implementation-dependent stuff in brainfuck which affects the constant. Consider the program