On Sunday, April 7, 2019 at 5:03:07 PM UTC-5, John Clark wrote: > > On Sun, Apr 7, 2019 at 2:26 PM Lawrence Crowell <goldenfield...@gmail.com > <javascript:>> wrote: > > >> > there is no comprehensive axiomatic system for Diophantine equations. >> Quantum numbers as Gödel numbers for integer solutions to Diophantine >> equations are then not entirely computable and there can't exist a >> Turing machine (in the classical sense a q → ∞ convex set) that computes >> quantum outcomes. >> > > I think the connection between Quantum Mechanics and Godel's uncertainty > is pretty tenuous. Neither a Quantum Computer or a conventional computer > can compute the 7918th Busy Beaver number, and even though its computable > and finite its very unlikely a Quantum Computer could compute the Ackermann > function in polynomial time which effectively makes it non-computable for > practical purposes. > > >> > I then maintain the solution to the quantum measurement problem is >> that there can't exist such a solution. It is an unsolvable problem. >> > > There are important differences that need to be explained. You can solve > the problem of figuring out if Schrodinger's Cat is alive or dead simply by > opening the box and looking, but there is no box you can open to figure out > what the 8000th Busy Beaver number is. > > John K Clark >
You can't compute outcome prior to an observation. Quantum interpretations are meant to gives some explanation for quantum outcomes, but they all contradict each other, but are still consistent with QM. This sound very similar to forcing conditions on undecidable propositions. 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 everything-list+unsubscr...@googlegroups.com. To post to this group, send email to everything-list@googlegroups.com. Visit this group at https://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/d/optout.
