Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

5 relations
Alternate reality gameCybercrimeInternet backboneKey server (cryptographic)
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… Expand
2014
2014
Health and Welfare Preempted: How National Meat Association v. Harris Undermines Federalism, Food Safety and Animal Protection
 
2011
2011
Concrete Digital Computation: What Does it Take for a Physical System to Compute?
  • N. Fresco
  • J. Log. Lang. Inf.
  • 2011
    • Corpus ID: 35484248
This paper deals with the question: what are the key requirements for a physical system to perform digital computation? Time and… Expand
2010
2010
Zigzags in Turing Machines
We study one-head machines through symbolic and topological dynamics. In particular, a subshift is associated to the subshift… Expand
2010
2010
Yet Another Aperiodic Tile Set
We present here an elementary construction of an aperiodic tile set. Although there already exist dozens of examples of aperiodic… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2010
2010
Construction of an Aperiodic Tile Set 2
We present here an elementary construction of an aperiodic tile set. Although there already exist dozens of examples of aperiodic… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2004
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… Expand
  • figure 1
2004
2004
Turing Machine with Faults, Failures and Recovery
A Turing machine with faults, failures and recovery (TMF) is described. TMF is (weakly) non-deterministic Turing machine… Expand
1983
1983
Application of the Federal Abstention Doctrines to the Domestic Relations Exception to Federal Diversity Jurisdiction
Despite the broad constitutional' and statutory2 provisions granting federal diversity jurisdiction, the judiciary3 has created… Expand
1977
1977
On the Formal Definiton of Dependencies between the Control and Information Structure of a Data Space
Abstract A data space is a general mathematical model for data types with a dynamic component (procedures). It consists of a set… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE