相关论文: Irreducible Complexity in Pure Mathematics

Not only did Turing help found one of the most exciting areas of modern science (computer science), but it may be that his contribution to our understanding of our physical reality is greater than we had hitherto supposed. Here I explore…

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…

General relativity treats spacetime as dynamical and exhibits its breakdown at singularities. This failure is interpreted as evidence that quantum gravity is not a theory formulated within spacetime; instead, it must explain the very…

This article explores the following methodological principle for theory construction in physics: if an ontological theory predicts two scenarios that are ontologically distinct but empirically indiscernible, then this theory should be…

Most work on computational complexity is concerned with time. However this course will try to show that program-size complexity, which measures algorithmic information, is of much greater philosophical significance. I'll discuss how one can…

We reminisce and discuss applications of algorithmic probability to a wide range of problems in artificial intelligence, philosophy and technological society. We propose that Solomonoff has effectively axiomatized the field of artificial…

Chinese ancient sage Laozi said that everything comes from `nothing'. Einstein believes the principle of nature is simple. Quantum physics proves that the world is discrete. And computer science takes continuous systems as discrete ones.…

One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong. In…

The world of mathematics is often considered abstract, with its symbols, concepts, and topics appearing unrelated to physical objects. However, it is important to recognize that the development of mathematics is fundamentally influenced by…

In this article, we shall describe some of the most interesting topics in the subject of Complexity Science for a general audience. Anyone with a solid foundation in high school mathematics (with some calculus) and an elementary…

This article is a brief guide to the field of algorithmic information theory (AIT), its underlying philosophy, and the most important concepts. AIT arises by mixing information theory and computation theory to obtain an objective and…

In 1963 Edward Lorenz revealed deterministic predictability to be an illusion and gave birth to a field that still thrives. This Feature Article discusses Lorenz's discovery and developments that followed from it.

Given the emergent reasoning abilities of large language models, information retrieval is becoming more complex. Rather than just retrieve a document, modern information retrieval systems advertise that they can synthesize an answer based…

While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between an individual data sample and an individual model summarizing…

The 20th century has revealed two important limitations of scientific knowledge. On the one hand, the combination of Poincar\'e's nonlinear dynamics and Heisenberg's uncertainty principle leads to a world picture where physical reality is,…

Appeals to randomness in various number-theoretic constructions appear regularly in modern scientific publications. Such famous names as V.I. Arnold, M. Katz, Ya.G. Sinai, and T. Tao are just a few examples. Unfortunately, all of these…

This article is a brief personal account of the past, present, and future of algorithmic randomness, emphasizing its role in inductive inference and artificial intelligence. It is written for a general audience interested in science and…

In the paper we present results to develop an irreducible theory of complex systems in terms of self-organization processes of prime integer relations. Based on the integers and controlled by arithmetic only the self-organization processes…

The fundamental impasses and ruptures in various domains of the canonical, unitary science, or the 'end of science', become the more and more evident. The natural unity of being is recovered within a universal nonperturbative method leading…

This article discusses what can be proved about the foundations of mathematics using the notions of algorithm and information. The first part is retrospective, and presents a beautiful antique, Godel's proof, the first modern incompleteness…