You're ignoring quantum and photonic computing??!!
-----Original Message----- From: Lawrence Crowell <[email protected]> To: Everything List <[email protected]> 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 @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/78b7f972-953b-48a2-94b3-112693535723%40googlegroups.com. -- 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/1619381906.4277894.1583986909084%40mail.yahoo.com.
