A family of Gödel machine implementations

Bas R. Steunebrink; Jürgen Schmidhuber

doi:10.1007/978-3-642-22887-2_29

A family of Gödel machine implementations

Bas R. Steunebrink, Jürgen Schmidhuber

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

8 Scopus citations

Abstract

The Gödel Machine is a universal problem solver encoded as a completely self-referential program capable of rewriting any part of itself, provided it can prove that the rewrite is useful according to some utility function, encoded within itself. Based on experience gained by constructing a virtual machine capable of running the first Gödel Machine implementation written in self-referential code, we discuss several important refinements of the original concept. We also show how different approaches to implementing the proof search leads to a family of possible Gödel Machine implementations. © 2011 Springer-Verlag Berlin Heidelberg.

Original language	English (US)
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages	275-280
Number of pages	6
DOIs	https://doi.org/10.1007/978-3-642-22887-2_29
State	Published - Aug 11 2011
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-22887-2_29

Cite this

@inproceedings{c25d27a6ccb24238b14abda790368b74,

title = "A family of G{\"o}del machine implementations",

abstract = "The G{\"o}del Machine is a universal problem solver encoded as a completely self-referential program capable of rewriting any part of itself, provided it can prove that the rewrite is useful according to some utility function, encoded within itself. Based on experience gained by constructing a virtual machine capable of running the first G{\"o}del Machine implementation written in self-referential code, we discuss several important refinements of the original concept. We also show how different approaches to implementing the proof search leads to a family of possible G{\"o}del Machine implementations. {\textcopyright} 2011 Springer-Verlag Berlin Heidelberg.",

author = "Steunebrink, {Bas R.} and J{\"u}rgen Schmidhuber",

note = "Generated from Scopus record by KAUST IRTS on 2022-09-14",

year = "2011",

month = aug,

day = "11",

doi = "10.1007/978-3-642-22887-2_29",

language = "English (US)",

isbn = "9783642228865",

pages = "275--280",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A family of Gödel machine implementations

AU - Steunebrink, Bas R.

AU - Schmidhuber, Jürgen

N1 - Generated from Scopus record by KAUST IRTS on 2022-09-14

PY - 2011/8/11

Y1 - 2011/8/11

N2 - The Gödel Machine is a universal problem solver encoded as a completely self-referential program capable of rewriting any part of itself, provided it can prove that the rewrite is useful according to some utility function, encoded within itself. Based on experience gained by constructing a virtual machine capable of running the first Gödel Machine implementation written in self-referential code, we discuss several important refinements of the original concept. We also show how different approaches to implementing the proof search leads to a family of possible Gödel Machine implementations. © 2011 Springer-Verlag Berlin Heidelberg.

AB - The Gödel Machine is a universal problem solver encoded as a completely self-referential program capable of rewriting any part of itself, provided it can prove that the rewrite is useful according to some utility function, encoded within itself. Based on experience gained by constructing a virtual machine capable of running the first Gödel Machine implementation written in self-referential code, we discuss several important refinements of the original concept. We also show how different approaches to implementing the proof search leads to a family of possible Gödel Machine implementations. © 2011 Springer-Verlag Berlin Heidelberg.

UR - http://link.springer.com/10.1007/978-3-642-22887-2_29

UR - http://www.scopus.com/inward/record.url?scp=79961205874&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-22887-2_29

DO - 10.1007/978-3-642-22887-2_29

M3 - Conference contribution

SN - 9783642228865

SP - 275

EP - 280

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -

A family of Gödel machine implementations

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this