|
gptkbp:instance_of
|
gptkb:theorem
|
|
gptkbp:applies_to
|
mathematical logic
|
|
gptkbp:has_historical_significance
|
gptkb:Mathematics
|
|
gptkbp:has_implications_for
|
gptkb:Artificial_Intelligence
gptkb:computer_science
theory of computation
the nature of mathematical truth
|
|
gptkbp:has_practical_applications_in
|
gptkb:Software_Development
|
|
gptkbp:has_theoretical_importance_in
|
the study of algorithms
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Church's thesis
|
|
gptkbp:influenced_by
|
gptkb:Gödel's_incompleteness_theorems
|
|
gptkbp:introduced_in
|
1930s
|
|
gptkbp:is_a_subject_of
|
academic papers
debates in philosophy
|
|
gptkbp:is_challenged_by
|
quantum computing theories
|
|
gptkbp:is_cited_in
|
theoretical computer science literature
|
|
gptkbp:is_considered
|
computational experiments
a foundational concept in computer science.
|
|
gptkbp:is_criticized_for
|
foundations of mathematics
|
|
gptkbp:is_debated_in
|
every effectively calculable function is computable by a Turing machine.
|
|
gptkbp:is_described_as
|
computer science courses
|
|
gptkbp:is_discussed_in
|
philosophy of mathematics
mathematical logic textbooks
|
|
gptkbp:is_explored_in
|
philosophical discussions
|
|
gptkbp:is_fundamental_to
|
computational theory
|
|
gptkbp:is_noted_for
|
history of mathematics
|
|
gptkbp:is_reflected_in
|
computational complexity theory
|
|
gptkbp:is_related_to
|
recursive functions
computable functions
formal systems
algorithmic information theory
|
|
gptkbp:is_supported_by
|
Turing's work
|
|
gptkbp:is_used_in
|
algorithm design
programming language theory
|
|
gptkbp:is_used_to
|
define computability
|
|
gptkbp:known_as
|
gptkb:Church-Turing_thesis
|
|
gptkbp:proposed_by
|
gptkb:Alonzo_Church
the context of logic
|
|
gptkbp:related_to
|
Turing machines
lambda calculus
computability
|
|
gptkbp:was_influenced_by
|
Hilbert's program
|
|
gptkbp:was_refined_by
|
subsequent research
|
|
gptkbp:bfsParent
|
gptkb:Alonzo_Church
|
|
gptkbp:bfsLayer
|
5
|