I think I found a way to get computationalism fully to work, and its fundamental algebra is the boolean automaton, but I am worried that fully accepting the solution will turn me in into a boolean automaton. If I am wrong, I will lose consciousness, if I am right, I never had it.
-
-
I thought it was shown (theoretically) that a quantum computer could simulate a classical TM with the same efficiency, and compute other things with greater efficiency. That said, I'm not familiar with how 'digital physics' differs.
-
If I understand correctly, a quantum computer would operate at least in BQP, and if BQP is not fully within P, then the inverse is not true, i.e. a TM could not efficiently a quantum TM. But digital physicists mostly think that the the Church Turing thesis is a physical law.
- 3 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.