4 found
Order:
  1. On the Origin of the Laws of Physics From the Properties of Algorithms.Alexandre Harvey Tremblay - manuscript
    I propose a method to derive the familiar laws of physics from algorithmic information theory (AIT). Specifically, I introduce the notion of a proven computing reserve and I use it to connect AIT to physics.
    Download  
     
    Export citation  
     
    My bibliography  
  2.  87
    The World is an Autology Derived From All Tautologies.Alexandre Harvey Tremblay - manuscript
    We report a mathematical construction that is autological, universal and tautological. The autological property allows the derivation of the laws of physics from the construction, while the other two properties explain why the construction is universally and necessarily applicable to the world. The construction can explain the World at its most fundamental level up to and including the derivation of the familiar laws of physics. It is formulated as a statistical ensemble of feasible mathematics (an algorithmic information theory analog to (...)
    Download  
     
    Export citation  
     
    My bibliography  
  3.  19
    On the Entropic Origin of the Cosmos.Alexandre Harvey Tremblay - manuscript
    We present a simple model of cosmology inspired by a cycle of statistical physics involving the age, the size and the entropy of the system. The model is formalized in statistical physics by the introduction of a micro-state q defined only with a time quantity t(q) and a position quantity x(q). In this representation, many of the laws of classical physics (inertia, special relativity, general relativity, and dark energy) are emergent as entropic laws and are associated to the thermodynamic trade-offs (...)
    Download  
     
    Export citation  
     
    My bibliography  
  4.  22
    Feasible Mathematics.Alexandre Harvey Tremblay - manuscript
    From algorithmic information theory (and using notions of algorithmic thermodynamics), we introduce *feasible mathematics* as distinct from *universal mathematics*. Feasible mathematics formalizes the intuition that theorems with very long proofs are unprovable within the context of limited computing resources. It is formalized by augmenting the standard construction of Omega with a conjugate-pair that suppresses programs with long runtimes. The domain of the new construction defines feasible mathematics.
    Download  
     
    Export citation  
     
    My bibliography