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

Using algorithmic complexity theory methods, we propose a robust computational definitions for open-ended evolution and adaptability of computable dynamical systems.Expand

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

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

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

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

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

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