There is a "contest" of essays on the hyper-super-beyond-computable:
*FQXi FORUM: Undecidability, Uncomputability, and Unpredictability Essay Contest* https://fqxi.org/community/forum/category/31427?sort=author If I wrote an essay the theme would be that undecidability and uncomputability are *useless* to science. Suppose we found some actual matter that does infinite-time computing https://arxiv.org/abs/math/9808093 We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. and actual experiments that supported that conclusion! Then we he would have matter that does compute infinitely. @philipthrift On Wednesday, March 11, 2020 at 11:21:55 PM UTC-5, [email protected] wrote: > > You're ignoring quantum and photonic computing??!! > > > -----Original Message----- > From: Lawrence Crowell <[email protected] <javascript:>> > To: Everything List <[email protected] <javascript:>> > Sent: Wed, Mar 11, 2020 10:31 am > Subject: Re: Reachability for infinite -time Turing machines with long > tapes > > On Tuesday, March 10, 2020 at 10:16:38 AM UTC-5, Philip Thrift wrote: > > > https://arxiv.org/abs/1802. 05734 <https://arxiv.org/abs/1802.05734> > > @philipthrift > > > It looks to be a version of the busy beaver problem. The scale of the > problem grows beyond computable bounds. > > LC > > -- 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 view this discussion on the web visit https://groups.google.com/d/msgid/everything-list/6e12ef7f-a8b0-402b-b6f2-9d9be2b86d9a%40googlegroups.com.
