Can Laplace's formula model a deterministic universe that is irreducibly probabilistic?
General Mathematics
2007-05-23 v1
Abstract
If we assume the Thesis that any classical Turing machine T, which halts on every n-ary sequence of natural numbers as input in a determinate time t(n), determines a PA-provable formula, whose standard interpretation is an n-ary arithmetical relation f(x1, ..., xn) that holds if, and only if, T halts, then we can define Laplace's formula recursively such that it can model the state of a deterministic quantum universe that is irreducibly probabilistic.
Cite
@article{arxiv.math/0307104,
title = {Can Laplace's formula model a deterministic universe that is irreducibly probabilistic?},
author = {Bhupinder Singh Anand},
journal= {arXiv preprint arXiv:math/0307104},
year = {2007}
}
Comments
27 pages; an HTML version is available at http://alixcomsi.com/Can_Laplace's_formula.htm