Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,219,312 papers from all fields of science
Search
Sign In
Create Free Account
Machine that always halts
Known as:
Decider (computability theory)
, Machines that always halt
, Total Turing machine
In computability theory, a machine that always halts—also called a decider (Sipser, 1996) or a total Turing machine (Kozen, 1997)—is a Turing machine…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
22 relations
Ackermann function
Arithmetical hierarchy
BASIC
BlooP and FlooP
Expand
Broader (1)
Turing machine
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Bitcoin: A Total Turing Machine
C. Wright
Intelligent Systems with Applications
2019
Corpus ID: 201706242
We demonstrate that the Bitcoin script language allows not only for primitive recursion, but in the deployment of an Ackermann…
Expand
2017
2017
ASCENT: A Provably Terminating Decentralized Logging Service
Xavier Bonnaire
,
Rudyar Cortés
,
F. Kordon
,
O. Marin
Computer/law journal
2017
Corpus ID: 21762383
Building a certification authority that is both decentralized and fully reliable is impossible. However, the limitation thus…
Expand
2011
2011
The provably terminating operations of the subsystem PETJ of explicit mathematics
D. Probst
Annals of Pure and Applied Logic
2011
Corpus ID: 2555086
Review
2010
Review
2010
Weak theories of operations and types
T. Strahm
2010
Corpus ID: 562085
This is a survey paper on various weak systems of Feferman’s explicit mathematics and their proof theory. The strength of the…
Expand
2009
2009
The Complexity of Finding SUBSEQ(A)
Stephen A. Fenner
,
W. Gasarch
,
B. Postow
Theory of Computing Systems
2009
Corpus ID: 176118
Higman showed that if A is any language then SUBSEQ(A) is regular. His proof was nonconstructive. We show that the result cannot…
Expand
2008
2008
Ranzi Michael Rathjen Peter Schuster Helmut Schwichtenberg Monika Seisenberger Anton Setzer Daria Spescha Nik Sultana Stan Wainer Albert Ziegler Wolfgang Zuber
F. Kuhlmann
2008
Corpus ID: 47774773
s Andreas Abel: Normalization by Evaluation for Martin-Löf Type Theory The decidability of equality is proved for Martin-Löf type…
Expand
2002
2002
MEER F An EER model enhanced with structure methods $
Mira Balaban
,
P. Shoval
2002
Corpus ID: 16877509
Entity relationship (ER) schemas include cardinality constraints, that restrict the dependencies among entities within a…
Expand
2001
2001
Inferring termination conditions for logic programs using backwards analysis
S. Genaim
,
M. Codish
Theory and Practice of Logic Programming
2001
Corpus ID: 9341809
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalises traditional…
Expand
2000
2000
cTI: Bottom-Up Termination Inference for Logic Programs
Serge Burckel
,
S. Hoarau
,
F. Mesnard
,
U. Neumerkel
Workshop Logische Programmierung
2000
Corpus ID: 9200917
We present cTI, a system for bottom-up termination inference. Termination inference is a generalization of termination analy-sis…
Expand
1994
1994
A Simple Transformation for Offline-Parsable Grammars and its Termination Properties
Marc Dymetman
International Conference on Computational…
1994
Corpus ID: 12900947
We present, in easily reproducible terms, a simple transformation for offline-parsable grammars which results in a provably…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE