Discussion Overview
The discussion revolves around the question of recognizing processes in nature that compute functions not computable by a Turing machine. It explores theoretical implications, particularly in the context of quantum mechanics and computability.
Discussion Character
- Exploratory
- Debate/contested
- Technical explanation
Main Points Raised
- Some participants propose that true random number generation, as seen in certain quantum processes, may indicate a function that a Turing machine cannot compute.
- Others argue that our observational limitations prevent us from definitively recognizing whether a process is computable or uncomputable, suggesting that hidden variables could play a role.
- A participant questions whether the discussion relates to hidden variable theories in quantum mechanics and requests clarification on current thinking in this area.
- Another participant mentions Bohmian Mechanics as a significant hidden variable theory, noting that it suggests randomness in quantum theory may arise from deterministic processes.
- Concerns are raised about the relevance of Bohmian Mechanics in mainstream science, with some suggesting it lacks practical application.
- There is a discussion about the current status of research in Bohmian Mechanics, with some participants indicating that work is ongoing but limited to a small group of researchers.
Areas of Agreement / Disagreement
Participants express differing views on the implications of quantum mechanics for computability, with no consensus on whether Bohmian Mechanics represents a viable path forward or a dead end.
Contextual Notes
The discussion highlights limitations in current understanding and the dependence on definitions of computability and randomness, as well as the unresolved nature of the theories discussed.