/sci/ - Science & Math

>>2247512
Hypothesis: The universe is computable in the sense of the Church-Turing-Deutsch principle.

http://en.wikipedia.org/wiki/Church%E2%80%93Turing%E2%80%93Deutsch_principle

Prediction: Every physical system has a measure of information that is isomorphic to it. IE physical systems are equivalent to their encoding as information.

Question: how do you count the number of bits that encodes a physical system like a proton?

>>2234461
Assuming Law of Excluded Middle, assuming Law of Non-Contradiction, defining proof by contradiction, admitting proof by contradiction as valid.

http://arxiv.org/abs/1003.5976
http://en.wikipedia.org/wiki/Self-verifying_theories

http://plato.stanford.edu/entries/logic-paraconsistent/

A paraconsistent universe is both contradiction tolerant and can be logically complete. It is the simpler of the two models, it assumes the fewest entities while proving almost as many theorems as the alternative. By Occam's razor it is to be preferred.

Taking Non-contradiction to be a hypothesis, we can demonstrate it to be false in non-locality experiments where a qubit exists in two contradictory states at the same time.

Taking Excluded Middle to be a hypothesis, we can demonstrate it to be false in superposition experiments by showing that an ensemble of qubits state's can exist somewhere between the extremes with a given set of probabilities for each state and with a degree of uncertainty.

Finally, how does the universe being subject to Godel's proof serve to refute the universe being mathematical?