We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...
We envision a future where each person will carry with them a personal universal controller (PUC), a portable computerized device that allows the user to control any appliance wit...
Jeffrey Nichols, Brad A. Myers, Michael Higgins, J...
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...