Construction theory, self-replication, and the halting problem

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

This essay aims to propose construction theory, a new domain of theoretical research on machine construction, and use it to shed light on a fundamental relationship between living and computational systems. Specifically, we argue that self-replication of von Neumann's universal constructors holds a close similarity to circular computational processes of universal computers that appear in Turing's original proof of the undecidability of the halting problem. The result indicates the possibility of reinterpreting a self-replicating biological organism as embodying an attempt to solve the halting problem for a diagonal input in the context of construction. This attempt will never be completed because of the indefinite cascade of self-computation/construction, which accounts for the undecidability of the halting problem and also agrees well with the fact that life has maintained its reproductive activity for an indefinitely long period of time.

Original languageEnglish
Pages (from-to)16-22
Number of pages7
JournalComplexity
Volume13
Issue number5
DOIs
Publication statusPublished - 2008 May
Externally publishedYes

Fingerprint

organisms
Research

ASJC Scopus subject areas

  • Agricultural and Biological Sciences(all)

Cite this

Construction theory, self-replication, and the halting problem. / Sayama, Hiroki.

In: Complexity, Vol. 13, No. 5, 05.2008, p. 16-22.

Research output: Contribution to journalArticle

@article{47477078433c492299c94759520f707c,
title = "Construction theory, self-replication, and the halting problem",
abstract = "This essay aims to propose construction theory, a new domain of theoretical research on machine construction, and use it to shed light on a fundamental relationship between living and computational systems. Specifically, we argue that self-replication of von Neumann's universal constructors holds a close similarity to circular computational processes of universal computers that appear in Turing's original proof of the undecidability of the halting problem. The result indicates the possibility of reinterpreting a self-replicating biological organism as embodying an attempt to solve the halting problem for a diagonal input in the context of construction. This attempt will never be completed because of the indefinite cascade of self-computation/construction, which accounts for the undecidability of the halting problem and also agrees well with the fact that life has maintained its reproductive activity for an indefinitely long period of time.",
author = "Hiroki Sayama",
year = "2008",
month = "5",
doi = "10.1002/cplx.20218",
language = "English",
volume = "13",
pages = "16--22",
journal = "Complexity",
issn = "1076-2787",
publisher = "John Wiley and Sons Inc.",
number = "5",

}

TY - JOUR

T1 - Construction theory, self-replication, and the halting problem

AU - Sayama, Hiroki

PY - 2008/5

Y1 - 2008/5

N2 - This essay aims to propose construction theory, a new domain of theoretical research on machine construction, and use it to shed light on a fundamental relationship between living and computational systems. Specifically, we argue that self-replication of von Neumann's universal constructors holds a close similarity to circular computational processes of universal computers that appear in Turing's original proof of the undecidability of the halting problem. The result indicates the possibility of reinterpreting a self-replicating biological organism as embodying an attempt to solve the halting problem for a diagonal input in the context of construction. This attempt will never be completed because of the indefinite cascade of self-computation/construction, which accounts for the undecidability of the halting problem and also agrees well with the fact that life has maintained its reproductive activity for an indefinitely long period of time.

AB - This essay aims to propose construction theory, a new domain of theoretical research on machine construction, and use it to shed light on a fundamental relationship between living and computational systems. Specifically, we argue that self-replication of von Neumann's universal constructors holds a close similarity to circular computational processes of universal computers that appear in Turing's original proof of the undecidability of the halting problem. The result indicates the possibility of reinterpreting a self-replicating biological organism as embodying an attempt to solve the halting problem for a diagonal input in the context of construction. This attempt will never be completed because of the indefinite cascade of self-computation/construction, which accounts for the undecidability of the halting problem and also agrees well with the fact that life has maintained its reproductive activity for an indefinitely long period of time.

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

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

U2 - 10.1002/cplx.20218

DO - 10.1002/cplx.20218

M3 - Article

AN - SCOPUS:51349120586

VL - 13

SP - 16

EP - 22

JO - Complexity

JF - Complexity

SN - 1076-2787

IS - 5

ER -