Can Laplace's formula model a deterministic universe that is irreducibly probabilistic?

Simple item page
dc.creatorAnand, Bhupinder Singh
dc.date2003-07-09
dc.date.accessioned2026-07-07T04:59:30Z
dc.date.available2026-07-07T04:59:30Z
dc.descriptionIf 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.
dc.description27 pages; an HTML version is available at http://alixcomsi.com/Can_Laplace's_formula.htm
dc.identifierhttps://arxiv.org/abs/math/0307104
dc.identifierhttp://arxiv.org/abs/math/0307104
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68009
dc.subjectGeneral Mathematics
dc.subject03B10
dc.titleCan Laplace's formula model a deterministic universe that is irreducibly probabilistic?
dc.typetext

Files

Collections

arXiv