Sciweavers

4940 search results - page 7 / 988
» On the Complexity of Universal Programs
Sort
View
DAGSTUHL
2006
13 years 8 months ago
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence fo
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...
Boris Ryabko, Jaakko Astola, Alexander Gammerman
FOCS
2006
IEEE
14 years 1 months ago
On the time complexity of 2-tag systems and small universal Turing machines
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...
Damien Woods, Turlough Neary
CHI
2003
ACM
14 years 7 months ago
Personal universal controllers: controlling complex appliances with GUIs and speech
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...
AGI
2008
13 years 8 months ago
A computational approximation to the AIXI model
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...
Sergey Pankov
CIE
2007
Springer
14 years 1 months ago
The Complexity of Small Universal Turing Machines
Damien Woods, Turlough Neary