- #1
n01
- 49
- 4
The Church-Turing-Deutsch Principle states that any physical law can be computed.
This is a strong statement which many physicists assume without justification to be true at face value. However, I have not seen proof of the CTD principle being true.
From what I understand David Deutsch postulated this principle in regards to the feasibility of creating quantum computers and potentially justifying Everettian QM.
My question regarding the CTD principle is that what implications does the Incompleteness Theorem or the Halting problem have in regards to computing every physical law? Does the Incompleteness theorem or Halting problem deny the possibility of there existing a computer sophisticated enough to compute every physical law in existence?
Thank you.
This is a strong statement which many physicists assume without justification to be true at face value. However, I have not seen proof of the CTD principle being true.
From what I understand David Deutsch postulated this principle in regards to the feasibility of creating quantum computers and potentially justifying Everettian QM.
My question regarding the CTD principle is that what implications does the Incompleteness Theorem or the Halting problem have in regards to computing every physical law? Does the Incompleteness theorem or Halting problem deny the possibility of there existing a computer sophisticated enough to compute every physical law in existence?
Thank you.