yes, I didn't think about it, but you're right! However, I liked the idea to have a constructive way to build an uncomputable number
You have an assumption that each number needs a unique program to compute the digits. You'd need to prove that statement first.
By definition, each program only produces the digits of one number. It's okay for more than one program to produce the same number. Am I misunderstanding your point?
I didn’t realize the initial state of the tape was part of the definition of a Turing machine. I was picturing having the same operations applied to different tapes, but that’s not the definition so I’m wrong.
Re:A number that can't be calculated
by craggyjaggy on Tuesday October 25, 2022 @03:32PM
(#33335096)
How can the same program produce multiple different results?
Ah, I wrote the same proof above. I agree this is a much simpler way of proving the existence and size of the uncomputible numbers. The busy beavers problem is just an example of an interesting case
Easiest way to construct one is to use the diagonal argument that’s used to prove, amongst other things, the halting problem.