Incomputability in Physics

被引:0
|
作者
Longo, Giuseppe [1 ]
机构
[1] Ecole Normale Super, CNRS, Paris, France
来源
PROGRAMS, PROOFS, PROCESSES | 2010年 / 6158卷
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Computability originated from Logic and followed the original path proposed by the founding fathers of the modern foundational analysis of Mathematics (Frege, Hilbert). This theoretical path departed in principle from the contemporary renewed relations between Geometry and Physics. In particular, the key issue of physical measure, as our only access to "reality", is not part of its theoretical frame, in contrast to Physics, since Poincare, Planck and Einstein. Computability though, by its fine analysis of undecidability, provides a very useful tool for the investigation of "unpredictability" in Physics. Unpredictability coincides with physical randomness, in classical and quantum frames. And an understanding of randomness turns out to be a key component of intelligibility in Physics.
引用
收藏
页码:276 / 285
页数:10
相关论文
共 50 条
  • [1] Incomputability in Physics and Biology
    Longo, Giuseppe
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2012, 22 (05) : 880 - 900
  • [2] How real is incomputability in physics?
    Trejo, Jose Manuel Aguero
    Calude, Cristian S.
    Dinneen, Michael J.
    Fedorov, Arkady
    Kulikov, Anatoly
    Navarathna, Rohit
    Svozil, Karl
    THEORETICAL COMPUTER SCIENCE, 2024, 1003
  • [3] Incomputability at the foundations of physics (A study in the philosophy of science)
    Costa, Jose Felix
    JOURNAL OF LOGIC AND COMPUTATION, 2013, 23 (06) : 1225 - 1248
  • [4] Computability and incomputability
    Soare, Robert I.
    Computation and Logic in the Real World, Proceedings, 2007, 4497 : 705 - 715
  • [5] ON THE INCOMPUTABILITY OF COMPUTABLE DIMENSION
    Staiger, Ludwig
    LOGICAL METHODS IN COMPUTER SCIENCE, 2020, 16 (02) : 1 - 10
  • [6] Computability and incomputability of differential equations
    Cherardi, Guido
    DEDUCTION, COMPUTATION, EXPERIMENT: EXPLORING THE EFFECTIVENESS OF PROOF, 2008, : 223 - 242
  • [7] Algorithms9. Universality and incomputability
    R. K. Shyamasundar
    Resonance, 1997, 2 (10) : 17 - 28
  • [8] Incomputability of Simply Connected Planar Continua
    Kihara, Takayuki
    COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE, 2012, 1 (02): : 131 - 152
  • [9] Experimental evidence of quantum randomness incomputability
    Calude, Cristian S.
    Dinneen, Michael J.
    Dumitrescu, Monica
    Svozil, Karl
    PHYSICAL REVIEW A, 2010, 82 (02):
  • [10] Fundamentals of Algorithmic Markets: Liquidity, Contingency, and the Incomputability of Exchange
    Lotti L.
    Philosophy & Technology, 2018, 31 (1) : 43 - 58