Related papers: The logic of Turing progressions
The classical notions of continuity and mechanical causality are left in order to refor- mulate the Quantum Theory starting from two principles: I) the intrinsic randomness of quantum process at microphysical level, II) the projective…
The problem of pattern formation in a generic two species reaction--diffusion model is studied, under the hypothesis that only one species can diffuse. For such a system, the classical Turing instability cannot take place. At variance, by…
Mechanisms of pattern formation---of which the Turing instability is an archetype---constitute an important class of dynamical processes occurring in biological, ecological and chemical systems. Recently, it has been shown that the Turing…
Automated Theorem Proving (ATP) deals with the development of computer programs being able to show that some conjectures (queries) are a logical consequence of a set of axioms (facts and rules). There exists several successful ATPs where…
The origin of the uncertainty inherent in quantum measurements has been discussed since quantum theory's inception, but to date the source of the indeterminacy of measurements performed at an angle with respect to a quantum state's…
Why do quantum evolutions occur and why do they stop at certain points? In classical thermodynamics affinity was introduced to predict in which direction an irreversible process proceeds. In this paper the quantum mechanical counterpart of…
Quantum theory is formulated as the uniquely consistent way to manipulate probability amplitudes. The crucial ingredient is a consistency constraint: if the amplitude of a quantum process can be computed in two different ways, the two…
We introduce the notion of topological entropy of a formal languages as the topological entropy of the minimal topological automaton accepting it. Using a characterization of this notion in terms of approximations of the Myhill-Nerode…
This article supports the epistemological claim that sound human reasoning about ultimate knowledge is either foundational or circularly justified. In particular, questions which naturally arise in theology, philosophy, and related…
We consider the classical Turing instability in a reaction-diffusion system as the secend part of our study on pattern formation. We prove that nonlinear dynamics of a general perturbation of the Turing instability is determined by the…
We introduce topological differential testing (TDT), an approach to extracting the consensus behavior of a set of programs on a corpus of inputs. TDT uses the topological notion of a simplicial complex (and implicitly draws on richer…
Topological statistical theory provides the foundation for a modern mathematical reformulation of classical statistical theory: Structural Statistics emphasizes the structural assumptions that accompany distribution families and the set of…
The complexity class $NP$ can be logically characterized both through existential second order logic $SO\exists$, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as…
The detailed fluctuation theorem implies symmetry in the generating function of entropy production probability. The integral fluctuation theorem directly follows from this symmetry and the normalization of the probability. In this paper, we…
A convenient measure of a map or flow's chaotic action is the topological entropy. In many cases, the entropy has a homological origin: it is forced by the topology of the space. For example, in simple toral maps, the topological entropy is…
Automatic (i.e., computer-assisted) theorem proving (ATP) can come in many flavors. This document presents early steps in our effort towards defining object-oriented theorem proving (OOTP) as a new style of ATP. Traditional theorem proving…
We describe a method to axiomatize computations in deterministic Turing machines. When applied to computations in non-deterministic Turing machines, this method may produce contradictory (and therefore trivial) theories, considering…
Relational properties arise in many settings: relating two versions of a program that use different data representations, noninterference properties for security, etc. The main ingredient of relational verification, relating aligned pairs…
This is a short paper about the relationship between logic and computation. More specifically, it is about a relationship between the completeness proof for intuitionistic propositional logic within the form of proof-theoretic semantics…
In this note, we show the class of finite, epistemic programs to be Turing complete. Epistemic programs is a widely used update mechanism used in epistemic logic, where it such are a special type of action models: One which does not contain…