Re: algorithmic complexity of God

Anders Sandberg (asa@nada.kth.se)
15 Jan 1998 13:48:28 +0100

Maybe this article is relevant? It can be found on the net and is
quite fun.

http://fava.idsia.ch/~juergen/

@InCollection{Schmidhuber97,
author = {Jurgen Schmidhuber},
title = {A Computer Scientist's View of Life, the Universe, and Everything},
booktitle = {Foundations of Computer Science: Potential -- Theory -- Cognition},
publisher = {Springer},
year = 1997,
editor = {C. Freksa},
series = {Lecture Notes in Computer Science},
annote = {Is the universe computable? It may be cheaper to compute all universes than just one. http://fava.idsia.ch/~juergen/}
}

-- 
-----------------------------------------------------------------------
Anders Sandberg                                      Towards Ascension!
asa@nada.kth.se                            http://www.nada.kth.se/~asa/
GCS/M/S/O d++ -p+ c++++ !l u+ e++ m++ s+/+ n--- h+/* f+ g+ w++ t+ r+ !y