On Wednesday, March 11, 2020 at 11:21:55 PM UTC-5, [email protected] wrote: > > You're ignoring quantum and photonic computing??!! > > No, quantum computing does not even map NP problems into P. I does not get around incompleteness results of Turing and Goedel.
LC > > -----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] <javascript:>. > To view this discussion on the web visit > > https://groups.google.com/d/msgid/everything-list/78b7f972-953b-48a2-94b3-112693535723%40googlegroups.com > > <https://groups.google.com/d/msgid/everything-list/78b7f972-953b-48a2-94b3-112693535723%40googlegroups.com?utm_medium=email&utm_source=footer> > > . > -- 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/1c06645a-2f80-44ee-9d49-6a179e8a7892%40googlegroups.com.
