• Publications
  • Influence
Coding-theorem like behaviour and emergence of the universal distribution from resource-bounded algorithmic probability
TLDR
We show that up to 60% of the simplicity/complexity bias in distributions produced even by the weakest of the computational models can be accounted for by Algorithmic Probability in its approximation to the Universal Distribution. Expand
  • 27
  • 3
  • PDF
Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence
TLDR
We show that the undecidability of adapted states imposes novel and unpredictable behavior on the individuals or populations being modeled. Expand
  • 15
  • 2
  • PDF
The Limits of Decidable States on Open-Ended Evolution and Emergence
TLDR
Using algorithmic complexity theory methods, we propose a robust computational definitions for open-ended evolution and adaptability of computable dynamical systems. Expand
  • 8
  • 1
  • PDF
On the possible Computational Power of the Human Mind
TLDR
A possible characterization of the different power capabilities of the mind is suggested in terms of the information contained (in its computational complexity) or achievable by it. Expand
  • 10
  • PDF
Is there any Real Substance to the Claims for a 'New Computationalism'?
TLDR
Computationalism is a relatively vague term used to describe attempts to apply Turing’s model of computation to phenomena outside its original purview: in modelling the human mind, in physics, mathematics, etc. Expand
  • 2
  • PDF
Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between Computational Time and Information Value
TLDR
We show that strategies implemented in automatic theorem proving involve an interesting tradeoff between execution speed, proving speedup/computational time and usefulness of information in terms of (positive) speed-up. Expand
  • 1
  • PDF
A Complete Proof System for a Dynamic Epistemic Logic Based upon Finite pi-Calculus Processes
TLDR
In this paper we present the syntax and semantics of a dynamic epistemic logic for multi-agent systems, where the epistemic actions are finite processes in the pi-calculus. Expand
  • 1
  • PDF
Formal Semantics of a Dynamic Epistemic Logic for Describing Knowledge Properties of pi-Calculus Processes
TLDR
We present the formal syntax and semantics of a multi-agent dynamic epistemic logic that uses π-calculus processes as the actions of the language. Expand
  • 1
Some Assumptions about Problem Solving Method in Turing's Model of Intelligence
  • 1
Formal Verification for the Absence of Deadlock in the Manager Workers Pattern
TLDR
We formally verify the property known as “absence of deadlock” for the Manager-Workers pattern, a widely used architectural pattern for parallel programming, by means of formal verification using CCS. Expand