Related papers: The logic of Turing progressions
Formalisation is the process of writing system requirements in a formal language. These requirements mostly originate in Natural Language. In the field of Formal Methods, formalisation is often identified as one of the most delicate and…
A non-statistical theory of continuous, but irreversible, evolution can be constructed in terms of the Cartan calculus. The fundamental postulate, for an evolutionary theory which admits irreversible processes, is that the topology of the…
We develop two complementary generative mechanisms that explain when and why Benford's first-digit law arises. First, a probabilistic Turing machine (PTM) ensemble induces a geometric law for codelength. Maximizing its entropy under a…
We estimate density of defects frozen into a biological Turing pattern which was turned on at a finite rate. A self-locking of gene expression in individual cells, which makes the Turing transition discontinuous, stabilizes the pattern…
This short note introduces a formal system of truth and paradoxicality, outlining the main motivation, and proving its $\omega$-consistency. The system is called TP, for 'Truth and Paradoxicality'.
Consistent belief functions represent collections of coherent or non-contradictory pieces of evidence, but most of all they are the counterparts of consistent knowledge bases in belief calculus. The use of consistent transformations cs[.]…
A version of the second order phase transition theory, in which the Nernst theorem holds automatically, is proposed. The theory is constructed in terms of the order parameter and the (configurational) entropy. It faithfully reproduces the…
This paper presents a new system of logic, LF, that is intended to be used as the foundation of the formalization of science. That is, deductive validity according to LF is to be used as the criterion for assessing what follows from the…
Natural language explanations play a fundamental role in Natural Language Inference (NLI) by revealing how premises logically entail hypotheses. Recent work has shown that the interaction of large language models (LLMs) with theorem provers…
Non-classical logics are used in a wide spectrum of disciplines, including artificial intelligence, computer science, mathematics, and philosophy. The de-facto standard infrastructure for automated theorem proving, the TPTP World, currently…
Fluctuation Theorem(FT) has been studied as far from equilibrium theorem, which relates the symmetry of entropy production. To investigate the application of this theorem, especially to biological physics, we consider the FT for tilted…
By using conformal symmetry we unify the standard model of particle physics with gravity in a consistent quantum field theory which describes all the fundamental particles and forces of nature.
Finite Turing computation has a fundamental symmetry between inputs, outputs, programs, time, and storage space. Standard models of transfinite computational break this symmetry; we consider ways to recover it and study the resulting model…
The paper analyzes dynamic epistemic logic from a topological perspective. The main contribution consists of a framework in which dynamic epistemic logic satisfies the requirements for being a topological dynamical system thus interfacing…
We discuss historical attempts to formulate a physical hypothesis from which Turing's thesis may be derived, and also discuss some related attempts to establish the computability of mathematical models in physics. We show that these…
The paper offers a mathematical formalization of the Turing test. This formalization makes it possible to establish the conditions under which some Turing machine will pass the Turing test and the conditions under which every Turing machine…
Turbulent flows are out-of-equilibrium because the energy supply at large scales and its dissipation by viscosity at small scales create a net transfer of energy among all scales. Here, the energy cascade is approximated by a combined…
In the modern Bayesian view classical probability theory is simply an extension of conventional logic, i.e., a quantitative tool that allows for consistent reasoning in the presence of uncertainty. Classical theory presupposes, however,…
In this paper, we present a proof of the consistency of the New Foundations set theory ($\mathit{NF}$). $\mathit{NF}$'s main idea is to permit very large sets (including the Universal Set) by restricting set formation to stratified…
Nature is a blossoming of regular structures, signature of self-organization of the underlying microscopic interacting agents. Turing theory of pattern formation is one of the most studied mechanisms to address such phenomena and has been…