Construction theory, self-replication, and the halting problem

Complexity 13 (5):16-22 (2008)
  Copy   BIBTEX

Abstract

Complexity is pleased to announce the installment of Prof Hiroki Sayama as its new Chief Editor. In this Editorial, Prof Sayama describes his feelings about his recent appointment, discusses some of the journal’s journey and relevance to current issues, and shares his vision and aspirations for its future.

Categories

Keywords

Reprint years

DOI

10.1002/cplx.20218

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The Halting Problem Is Decidable on a Set of Asymptotic Probability One.Joel David Hamkins & Alexei Miasnikov - 2006 - Notre Dame Journal of Formal Logic 47 (4):515-524.
A mechanical proof of the unsolvability of the halting problem.Robert Boyer - unknown
A brief critique of pure hypercomputation.Paolo Cotogno - 2009 - Minds and Machines 19 (3):391-405.
Quantum hypercomputability?Amit Hagar & Alexandre Korolev - 2006 - Minds and Machines 16 (1):87-93.
Busy beaver competition and Collatz-like problems.Pascal Michel - 1993 - Archive for Mathematical Logic 32 (5):351-367.
Replication without replicators.Bence Nanay - 2011 - Synthese 179 (3):455-477.
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
The equivalence of NF-Style set theories with "tangled" theories; the construction of ω-models of predicative NF (and more).M. Randall Holmes - 1995 - Journal of Symbolic Logic 60 (1):178-190.
Promptness Does Not Imply Superlow Cuppability.David Diamondstone - 2009 - Journal of Symbolic Logic 74 (4):1264 - 1272.
Replication, replication and replication: Some hard lessons from model alignment.Bruce Edmonds - unknown
The diagonal method and hypercomputation.Toby Ord & Tien D. Kieu - 2005 - British Journal for the Philosophy of Science 56 (1):147-156.
Replication or reproduction?: Symbiogenesis as an alternative theory.Michael Glassman - 2001 - Behavioral and Brain Sciences 24 (3):537-538.
Generic Complexity of Undecidable Problems.Alexei G. Myasnikov & Alexander N. Rybalov - 2008 - Journal of Symbolic Logic 73 (2):656 - 673.
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.

Analytics

Added to PP
2014-01-20

Downloads
47 (#331,642)

6 months
5 (#638,139)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

On notation for ordinal numbers.S. C. Kleene - 1938 - Journal of Symbolic Logic 3 (4):150-155.

Add more references