On Mon, Sep 10, 2018 at 10:44 PM <[email protected]> wrote: *>Is it not computable because after some value of its argument, its mapped > value is greater than anything that can be written by a computer? AG* >
No that's not the fundamental problem. It is entirely possible that the 5th Busy Beaver number is 47,176,870 because a 5 state Turing Machine has been found that halts after 47,176,870 operations; computers have no trouble with numbers that small, the problem is there are still 5 different 5 state turing machines that are well past 47,176,870 and they have not halted. If none of those 5 machines ever halts then 47,176,870 really and truly is the 5th Busy Beaver number, but if that is the case we will never know that is the case because we'll never know that none of those 5 machines ever halts. John K Clark -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/d/optout.
