On Tuesday, September 11, 2018 at 5:54:06 AM UTC-5, Bruno Marchal wrote: > > > On 11 Sep 2018, at 04:44, [email protected] <javascript:> 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, even a computer with infinite time and infinite memory is not able to > compute it. The busy beaver is a well defined total (everywhere defined) > function which is not computable, even in theory. > > I can prove that, but have you understand that the Total-or-Partial > attribute of an arbitrary programs is a well defined function yet non > computable? I have proven this in my last post in the Church-Turing thread. > > > Why is the busy beaver not computable. The basic reason is that it gives > the bound of what you can compute with the machine, and if the BB function > was computable, you could use it to build a more powerful BB, notably by > diagonalisation. > > More on this later, > > Bruno > > > > On the BBP and hypercomputing:
*A New Godelian Argument for Hypercomputing Minds Based on the Busy Beaver Problem* https://newdualism.org/papers/S.Bringsjord/laihyper11.pdf - Philip Thrift -- 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.
