[New England
      Complex Systems Institute]
[Home] [Research] [Education] [Current Section: Activities & Events] [Community] [News] [The Complex World] [About Complex Systems] [About NECSI]
International Conference on Complex Systems (ICCS2006)

On self-replication and the halting problem

Hiroki Sayama
Department of Bioengineering, Binghamton University, SUNY

     Full text: Not available
     Last modified: May 31, 2006

I will elucidate a close similarity in formulation between self-replication of von Neumann's universal constructors and circular computational processes of universal computers that appear in Turing's original proof of the undecidability of the halting problem. The result indicates a possibility of reinterpreting self-replicating living systems as attemping to solve the undecidable halting problem in the context of construction.

Conference Home   |   Conference Topics   |   Application to Attend
Submit Abstract/Paper   |   Accommodation and Travel   |   Information for Participants

Maintained by NECSI Webmaster    Copyright © 2000-2005 New England Complex Systems Institute. All rights reserved.