Should computations halt?
From MaRDI portal
Cites work
- \(\lambda\)-definability and recursiveness.
- A set of postulates for the foundation of logic.
- A set of postulates for the foundation of logic. II
- An extensional treatment of dataflow deadlock
- An impossible program
- An unsolvable problem of elementary number theory.
- An unsolvable problem of elementary number theory.
- Axiomatisches Denken. Vortrag gehalten in der Schweizerischen mathematischen Gesellschaft, am 11. Sept. 1917 in Zürich.
- Computability and \(\lambda\)-definability.
- Computability and Recursion
- Data Types as Lattices
- David Hilbert's Lectures on the Foundations of Arithmetic and Logic 1917-1933
- Die Lösung eines Spezialfalles eines generellen logischen Problems.
- Finite combinatory processes—formulation
- Formal Reductions of the General Combinatorial Decision Problem
- General recursive functions of natural numbers
- Grundlagen der Mathematik. Bd. II.
- Grundlagen der Mathematik. I.
- Grundzüge der theoretischen Logik.
- Hilbert's Programs: 1917–1922
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 3131080 (Why is no real title available?)
- scientific article; zbMATH DE number 3909745 (Why is no real title available?)
- scientific article; zbMATH DE number 3926248 (Why is no real title available?)
- scientific article; zbMATH DE number 3961577 (Why is no real title available?)
- scientific article; zbMATH DE number 3784244 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 3624760 (Why is no real title available?)
- scientific article; zbMATH DE number 4128774 (Why is no real title available?)
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 1332646 (Why is no real title available?)
- scientific article; zbMATH DE number 2062344 (Why is no real title available?)
- scientific article; zbMATH DE number 3002822 (Why is no real title available?)
- scientific article; zbMATH DE number 1479633 (Why is no real title available?)
- scientific article; zbMATH DE number 1517346 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 194542 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 2118474 (Why is no real title available?)
- scientific article; zbMATH DE number 789389 (Why is no real title available?)
- scientific article; zbMATH DE number 928934 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Mathematical problems. Lecture delivered before the international congress of mathematicians at Paris in 1900. Translated by \textit{Mary Winston Newson}.
- Mathematische Probleme. Vortrag, gehalten auf dem internationalen Mathematiker-Congress zu Paris 1900.
- Meaningless terms in rewriting
- Normalization of Infinite Terms
- On computable numbers, with an application to the Entscheidungsproblem.
- On notation for ordinal numbers
- Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln.
- Productivity of stream definitions
- Proof by cases in formal logic
- PROVING PRODUCTIVITY IN INFINITE DATA STRUCTURES
- Recursive unsolvability of a problem of Thue
- Term Rewriting and All That
- The annotated Turing. A guided tour through Alan Turing's historic paper on computability and the Turing machine
- The origins of the halting problem
- Transfinite reductions in orthogonal term rewriting systems
- Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen.
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. I.
- Über unendliche Zeichenreihen.
- What Hilbert and Bernays meant by ``finitism
This page was built for publication: Should computations halt?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7268683)
