The G\"odelizing Quantum-Mechanical Automata
classification
🪐 quant-ph
keywords
albertspeakssystemunderstandargueautomataautomatonconclusions
read the original abstract
Using Albert results we argue that we don't need new physics to understand G\"odelization. Albert quantum automaton can "understand" both a formal system and a G\"odel proposition which can't be obtained within this system. There are two significant conclusions. The first speaks "against Penrose" whereas the second speaks for him.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.