Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,398,467 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
Research Report: Hardware-Enforcement of Walther-Recursive Program Functions
Jacob I. Torrey
,
Mark P. Bridgman
,
Tomasz Tuzel
IEEE Security and Privacy Workshops (SPW)
2017
Corpus ID: 33737958
Preliminary experiment design and research goals are presented to measure the security implications of using just-in-time (JIT…
Expand
2016
2016
Knowledge Management across Formal Libraries
Dennis Müller
FM4M/MathUI/ThEdu/DP/WIP@CIKM
2016
Corpus ID: 18473933
In my Ph.D., I want to contribute to developing an open archive for formalizations, a common and open infrastructure for managing…
Expand
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
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
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
1992
1992
Three monads for continuations
R. Kieburtz
,
Borislav Agapiev
,
J. Hook
1992
Corpus ID: 55295024
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
or Only Accept Required