A Computer Scientist's View of Life, the Universe, and Everything

04/13/1999
by   Juergen Schmidhuber, et al.
0

Is the universe computable? If so, it may be much cheaper in terms of information requirements to compute all computable universes instead of just ours. I apply basic concepts of Kolmogorov complexity theory to the set of possible universes, and chat about perceived and true randomness, life, generalization, and learning in a given universe.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/08/2018

On the close interaction between algorithmic randomness and constructive/computable measure theory

This is a survey of constructive and computable measure theory with an e...
research
04/06/2020

Complexity of majorants

The minimal Kolmogorov complexity of a total computable function that ex...
research
07/05/2017

The Complexity of Human Computation: A Concrete Model with an Application to Passwords

What can humans compute in their heads? We are thinking of a variety of ...
research
01/17/2018

Finitary-based Domain Theory in Coq: An Early Report

In domain theory every finite computable object can be represented by a ...
research
01/31/2018

On the computability of graphons

We investigate the relative computability of exchangeable binary relatio...
research
12/23/2017

Data

In this article, the data notion is mathematically conceptualized as typ...
research
09/30/2022

On the Salient Limitations of the Methods of Assembly Theory and their Classification of Molecular Biosignatures

A recently introduced approach termed "Assembly Theory", featuring a com...

Please sign up or login with your details

Forgot password? Click here to reset