FAQ

Halting State

Halting State is a novel by Charles Stross, published in the United States on 2 October 2007 and in the United Kingdom in January 2008. Stross has… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2017
0119772017

Related topics

Related topics

5 relations
Alternate reality gameCybercrimeInternet backboneKey server
(More)

Related mentions per year

Related mentions per year

1947-2018
19401960198020002020
Halting State
Internet backbone
Cybercrime
Massively multiplayer online role-playing game
Alternate reality game
Key server

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A small minimal aperiodic reversible Turing machine
A simple reversible Turing machine with four states, three symbols and no halting configuration is constructed that has no… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2015
2015
Computational complexity in language string processing and theory of halting problem in deterministic turing machine accepting context sensitive language, context free language or regular language
Turing machines are equivalent to modern electronic computers at a certain theoretical level, but differ in many details. In the… (More)
Is this relevant?
2007
2007
2-State 3-Color Universal Turing Machines Don't Exist
In this brief note, we give a simple information-theoretic proof that 2-state 3-color universal Turing machines don’t exist. Let… (More)
Is this relevant?
Review
2004
Review
2004
The complexity of reversible cellular automata
We study the orbits of reversible one-dimensional cellular automata. It is shown that the Turing degree structure of the orbits… (More)
  • figure 1
Is this relevant?
2004
2004
ar X iv : c s / 03 10 04 6 v 1 [ cs . C C ] 2 3 O ct 2 00 3 Theory of One Tape Linear Time Turing Machines ( Extended
A theory of one-tape linear-time Turing machines is quite different from its polynomial-time counterpart. This paper discusses… (More)
Is this relevant?
2004
2004
Diophantine Sets, Primes, and the Resolution of Hilbert’s 10th Problem
The term recursively enumerable set has its roots in logic but today is most commonly seen in reference to the theory of Turing… (More)
Is this relevant?
2003
2003
Turing machines
  • A “Turing
  • 2003
The tape is the machine’s “external memory”. It also has an internal memory, known as a state, which is represented by the letter… (More)
Is this relevant?
1998
1998
Emergence of Multicellular Organisms with Dynamic Differentiation and Spatial Pattern
The origin of multicellular organisms and the mechanism of development in cell societies are studied by choosing a model with… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
Development of Terminology for SCM1
We develop a higher level terminology for the SCM machine defined by Nakamura and Trybulec in [5]. Among numerous technical… (More)
Is this relevant?
1977
1977
On the Formal Definiton of Dependencies between the Control and Information Structure of a Data Space
A data space is a genefq _,..I mathematical model for data types with a dynamic component (proceduren). It consists of a set of… (More)
Is this relevant?