Computability and Unsolvability
E238242
Computability and Unsolvability is a classic 1958 textbook by Martin Davis that systematically develops the theory of computable functions and undecidable problems, helping to shape modern computability theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Computability and Unsolvability canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2139624 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Computability and Unsolvability Context triple: [Martin Davis, notableWork, Computability and Unsolvability]
-
A.
On Computable Numbers with an Application to the Entscheidungsproblem
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
-
B.
Computing with Register Machines
"Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
-
C.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
-
D.
Lectures on the Logic of Arithmetic
Lectures on the Logic of Arithmetic is an educational work by Mary Everest Boole that explores the foundations and teaching of arithmetic through logical and psychological principles.
-
E.
Remarks on the Foundations of Mathematics
Remarks on the Foundations of Mathematics is a posthumously published collection of Ludwig Wittgenstein’s later writings that critically examines the nature of mathematical truth, proof, and practice from a philosophical and language-centered perspective.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Computability and Unsolvability Target entity description: Computability and Unsolvability is a classic 1958 textbook by Martin Davis that systematically develops the theory of computable functions and undecidable problems, helping to shape modern computability theory.
-
A.
On Computable Numbers with an Application to the Entscheidungsproblem
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
-
B.
Computing with Register Machines
"Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
-
C.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
-
D.
Lectures on the Logic of Arithmetic
Lectures on the Logic of Arithmetic is an educational work by Mary Everest Boole that explores the foundations and teaching of arithmetic through logical and psychological principles.
-
E.
Remarks on the Foundations of Mathematics
Remarks on the Foundations of Mathematics is a posthumously published collection of Ludwig Wittgenstein’s later writings that critically examines the nature of mathematical truth, proof, and practice from a philosophical and language-centered perspective.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
book
ⓘ
person ⓘ textbook ⓘ |
| author | Martin Davis ⓘ |
| describedAs | classic text in computability theory ⓘ |
| field |
computability theory
ⓘ
mathematical logic ⓘ theoretical computer science ⓘ |
| format | print ⓘ |
| genre |
logic textbook
ⓘ
mathematics textbook ⓘ |
| hasAuthor | Martin Davis ⓘ |
| hasSubject |
computer science
ⓘ
logic ⓘ mathematics ⓘ |
| influenced |
development of modern computability theory
ⓘ
early theoretical computer science ⓘ |
| intendedAudience |
advanced undergraduates
ⓘ
graduate students ⓘ researchers in logic and computability ⓘ |
| knownFor |
authoring Computability and Unsolvability
ⓘ
work in computability theory ⓘ |
| language | English ⓘ |
| notableFor |
clear exposition of recursive function theory
ⓘ
historical influence on computability curricula ⓘ rigorous treatment of undecidable problems ⓘ |
| occupation |
logician
ⓘ
mathematician ⓘ |
| publicationYear | 1958 ⓘ |
| structure | systematic development of computability theory ⓘ |
| timePeriodDescribed | 20th-century foundations of computation ⓘ |
| topic |
Church–Turing thesis
ⓘ
Gödel numbering ⓘ Hilbert's Entscheidungsproblem ⓘ
linked to:
Entscheidungsproblem
Post correspondence problem ⓘ Turing machines ⓘ
linked to:
Turing machine
computable functions ⓘ decision problems ⓘ degrees of unsolvability ⓘ enumeration reducibility ⓘ partial recursive functions ⓘ primitive recursive functions ⓘ recursive functions ⓘ recursively enumerable sets ⓘ reduction between decision problems ⓘ undecidable problems ⓘ universal Turing machines ⓘ word problems in group theory ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Computability and Unsolvability Description of subject: Computability and Unsolvability is a classic 1958 textbook by Martin Davis that systematically develops the theory of computable functions and undecidable problems, helping to shape modern computability theory.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.