Disambiguation evidence for On Computable Numbers with an Application to the Entscheidungsproblem via surface form

"On Computable Numbers, with an Application to the Entscheidungsproblem"


As subject (46)

Triples where this entity appears as subject under the label "On Computable Numbers, with an Application to the Entscheidungsproblem".

Predicate Object
academicDiscipline foundations of mathematics
academicDiscipline logic in computer science
addressesProblem Entscheidungsproblem
author Alan Turing
citedAs On Computable Numbers with an Application to the Entscheidungsproblem self-linksurface differs
surface form: Turing 1936 paper
countryOfPublication United Kingdom
field computability theory
field mathematical logic
field theoretical computer science
followedBy lambda calculus
surface form: Computability and λ-definability
hasPart application to the Entscheidungsproblem
hasPart construction of a universal machine
hasPart definition of automatic machines
hasPart proof of the existence of uncomputable numbers
historicalSignificance foundational paper in computability theory
historicalSignificance one of the founding works of theoretical computer science
influenced development of computer science
influenced recursion theory
influenced theory of algorithms
influencedBy Entscheidungsproblem
surface form: David Hilbert’s Entscheidungsproblem
influencedBy Kurt Gödel’s work on formal systems
instanceOf computer science foundational work
instanceOf mathematics paper
instanceOf scientific paper
introducesConcept Turing machine
introducesConcept computable function
introducesConcept computable real number
introducesConcept Turing machine
surface form: universal Turing machine
language English
mainSubject On Computable Numbers with an Application to the Entscheidungsproblem self-linksurface differs
surface form: Entscheidungsproblem
mainSubject Turing machine
surface form: Turing machines
mainSubject computable numbers
provesResult existence of uncomputable numbers
provesResult existence of undecidable problems
provesResult unsolvability of the Entscheidungsproblem
publishedIn Proceedings of the London Mathematical Society
publisher London Mathematical Society
relatedTo Church–Turing thesis
relatedTo Gödel's incompleteness theorems
surface form: Gödel’s incompleteness theorems
relatedTo lambda calculus
shortTitle On Computable Numbers with an Application to the Entscheidungsproblem self-linksurface differs
surface form: On Computable Numbers
timePeriod 20th century
title On Computable Numbers with an Application to the Entscheidungsproblem self-link
surface form: On Computable Numbers, with an Application to the Entscheidungsproblem
usesMethod diagonalization
usesMethod encoding of machines as numbers
yearPublished 1936

As object (2)

Triples where some other subject referred to this entity as "On Computable Numbers, with an Application to the Entscheidungsproblem".

Alan Turing notableWork
"On Computable Numbers, with an Application to the Entscheidungsproblem"
On Computable Numbers with an Application to the Entscheidungsproblem title
"On Computable Numbers, with an Application to the Entscheidungsproblem"
self-link
surface form: On Computable Numbers, with an Application to the Entscheidungsproblem