Properties (70)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:theorem
|
| gptkbp:addresses |
the limits of computability.
|
| gptkbp:associated_with |
the concept of computable functions.
the_Church-Turing_thesis. |
| gptkbp:designedBy |
a_solution_to_the_decision_problem_for_Presburger_arithmetic.
|
| gptkbp:explores |
graduate-level studies.
the context of mathematical foundations. |
| gptkbp:has_a_focus_on |
philosophers of mathematics.
|
| gptkbp:has_implications_for |
programming languages.
|
| https://www.w3.org/2000/01/rdf-schema#label |
McCarthy's theorem
|
| gptkbp:influenced |
the development of algorithms.
|
| gptkbp:involves |
formal logic.
|
| gptkbp:is_a |
a non-trivial theorem.
|
| gptkbp:is_a_platform_for |
the development of programming paradigms.
the study of computation. |
| gptkbp:is_a_resource_for |
research in logic.
students of computer science. students of logic. |
| gptkbp:is_a_subject_of |
the field of artificial intelligence.
historical significance. the history of logic. the study of mathematical logic. academic inquiry. interest for computer scientists. interest in mathematical circles. mathematical foundations. ongoing research. research in theoretical computer science. the philosophy of computation. the study of formal proofs. the study of logic. the theory of computation. the theory of formal languages. debate_among_logicians. |
| gptkbp:is_essential_for |
mathematical logic.
the field of computer science. the field of theoretical computer science. the study of decision problems. the study of logic and computation. |
| gptkbp:is_featured_in |
the concept of decidable problems.
|
| gptkbp:is_part_of |
mathematical logic.
the curriculum in logic courses. the history of computer science. |
| gptkbp:is_referenced_in |
computer science literature.
the study of computability. |
| gptkbp:is_studied_in |
the study of algorithms.
the context of computational theory. the study of recursive functions. |
| gptkbp:is_used_in |
academic papers.
artificial intelligence. theoretical discussions. the foundations of mathematics. discussions of algorithmic complexity. discussions of computational limits. formal systems. the context of algorithm design. the context of decidability. the limits of formal systems. the power of formal systems. |
| gptkbp:isConnectedTo |
the study of algorithms.
|
| gptkbp:notable_event |
the history of mathematics.
|
| gptkbp:previousName |
John_McCarthy.
|
| gptkbp:publishedBy |
1956.
|
| gptkbp:related_to |
the field of logic programming.
the nature of mathematical truth. recursive functions. the study of proof theory. Gödel's_incompleteness_theorems. |
| gptkbp:suitableFor |
automated theorem proving.
|
| gptkbp:taught |
computer science courses.
|