Related papers: Self-replication and Computational Universality
We analyse the unreduced, nonperturbative dynamics of an arbitrary many-body interaction process with the help of the generalised effective potential method and reveal the well-specified universal origin of change (emergence), time and…
This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…
Reverse engineering the brain is proving difficult, perhaps impossible. While many believe that this is just a matter of time and effort, a different approach might help. Here, we describe a very simple idea which explains the power of the…
This work presents a novel computer architecture that extends the Von Neumann model with a dedicated Reasoning Unit (RU) to enable native artificial general intelligence capabilities. The RU functions as a specialized co-processor that…
The universal symmetry, or conservation, of complexity underlies any law or principle of system dynamics and describes the unceasing transformation of dynamic information into dynamic entropy as the unique way to conserve their sum, the…
To scrutinize notions of computation and time complexity, we introduce and formally define an interactive model for computation that we call it the \emph{computation environment}. A computation environment consists of two main parts: i) a…
Physical processes are computations only when we use them to externalize thought. Computation is the performance of one or more fixed processes within a contingent environment. We reformulate the Church-Turing thesis so that it applies to…
We show that the sheer existence of a quantum computational speedup logically implies the mutually exclusive or of well-defined causal loops. In each of them, it is as if the problem-solver knew in advance one of the possible halves of the…
The relationship between computational models and dynamics has captivated mathematicians and computer scientists since the earliest conceptualizations of computation. Recently, this connection has gained renewed attention, fueled by T.…
Computation is commonly defined as the execution of abstract algorithms over symbolic representations, with physical systems treated as substrates that realise predefined operations. While effective for engineered machines, this separation…
When can a model of a physical system be regarded as computable? We provide the definition of a computable physical model to answer this question. The connection between our definition and Kreisel's notion of a mechanistic theory is…
The present paper introduces a novel notion of `(effective) computability', called viability, of strategies in game semantics in an intrinsic (i.e., without recourse to the standard Church-Turing computability), non-inductive and…
Explaining the origin of life requires us to explain how self-replication arises. To be specific, how can a self-replicating entity develop spontaneously from a chemical reaction system in which no reaction is self-replicating? Previously…
This series presents an approach to mathematical biology which makes precise the function of biological molecules. Because biological systems compute, the theory is a general purpose computer language. I build a language for efficiently…
This paper discusses the meaning and scope of biological hypercomputation (BH). The framework here is computational, and from the outset it should be clear that life is not a standard Turing Machine. Living systems hypercompute, but the…
Cellular automata have long been celebrated for their ability to generate complex behaviors from simple, local rules, with well-known discrete models like Conway's Game of Life proven capable of universal computation. Recent advancements…
Spontaneous self-replication in cellular automata has long been considered rare, with most known examples requiring careful design or artificial initialization. In this paper, we present formal, causal evidence that such replication can…
This article presents a formal model demonstrating that genuine autonomy, the ability of a system to self-regulate and pursue objectives, fundamentally implies computational unpredictability from an external perspective. we establish…
Quantum computation is frequently mischaracterized as the simultaneous execution of exponentially many classical computations. This article offers a conceptual clarification of why this ``branchwise parallelism'' picture is misleading,…
It is argued that any possible definition of a realistic physics theory -- i.e., a mathematical model representing the real world -- cannot be considered comprehensive unless it is supplemented with requirement of being computationally…