Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/McCarthy_Formalism> ?p ?o }
Showing triples 1 to 48 of
48
with 100 triples per page.
- McCarthy_Formalism abstract "In computer science and recursion theory the McCarthy Formalism (1963) of computer scientist John McCarthy clarifies the notion of recursive functions by use of the IF-THEN-ELSE construction common to computer science, together with four of the operators of primitive recursive functions: zero, successor, equality of numbers and composition. The conditional operator replaces both primitive recursion and the mu-operator.".
- McCarthy_Formalism wikiPageExternalLink basis.html.
- McCarthy_Formalism wikiPageID "7667818".
- McCarthy_Formalism wikiPageLength "8494".
- McCarthy_Formalism wikiPageOutDegree "37".
- McCarthy_Formalism wikiPageRevisionID "653510194".
- McCarthy_Formalism wikiPageWikiLink Category:Computability_theory.
- McCarthy_Formalism wikiPageWikiLink Change_of_variables.
- McCarthy_Formalism wikiPageWikiLink Collectively_exhaustive_events.
- McCarthy_Formalism wikiPageWikiLink Computability_theory.
- McCarthy_Formalism wikiPageWikiLink Computer.
- McCarthy_Formalism wikiPageWikiLink Computer_science.
- McCarthy_Formalism wikiPageWikiLink Equality_(mathematics).
- McCarthy_Formalism wikiPageWikiLink Existential_quantification.
- McCarthy_Formalism wikiPageWikiLink George_S._Boolos.
- McCarthy_Formalism wikiPageWikiLink Graph_relation.
- McCarthy_Formalism wikiPageWikiLink John_McCarthy_(computer_scientist).
- McCarthy_Formalism wikiPageWikiLink John_P._Burgess.
- McCarthy_Formalism wikiPageWikiLink Karnaugh_map.
- McCarthy_Formalism wikiPageWikiLink Logical_conjunction.
- McCarthy_Formalism wikiPageWikiLink Logical_disjunction.
- McCarthy_Formalism wikiPageWikiLink Marvin_Minsky.
- McCarthy_Formalism wikiPageWikiLink Mathematical_induction.
- McCarthy_Formalism wikiPageWikiLink Multiplexer.
- McCarthy_Formalism wikiPageWikiLink Mutual_exclusivity.
- McCarthy_Formalism wikiPageWikiLink Negation.
- McCarthy_Formalism wikiPageWikiLink Primitive_recursive_function.
- McCarthy_Formalism wikiPageWikiLink Propositional_calculus.
- McCarthy_Formalism wikiPageWikiLink Propositional_formula.
- McCarthy_Formalism wikiPageWikiLink Recursion.
- McCarthy_Formalism wikiPageWikiLink Recursion_(computer_science).
- McCarthy_Formalism wikiPageWikiLink Richard_Jeffrey.
- McCarthy_Formalism wikiPageWikiLink Stephen_Cole_Kleene.
- McCarthy_Formalism wikiPageWikiLink Switch_statement.
- McCarthy_Formalism wikiPageWikiLink Truth_table.
- McCarthy_Formalism wikiPageWikiLink Universal_quantification.
- McCarthy_Formalism wikiPageWikiLink Μ_operator.
- McCarthy_Formalism wikiPageWikiLinkText "McCarthy Formalism".
- McCarthy_Formalism wikiPageUsesTemplate Template:Reflist.
- McCarthy_Formalism subject Category:Computability_theory.
- McCarthy_Formalism type Redirect.
- McCarthy_Formalism comment "In computer science and recursion theory the McCarthy Formalism (1963) of computer scientist John McCarthy clarifies the notion of recursive functions by use of the IF-THEN-ELSE construction common to computer science, together with four of the operators of primitive recursive functions: zero, successor, equality of numbers and composition. The conditional operator replaces both primitive recursion and the mu-operator.".
- McCarthy_Formalism label "McCarthy Formalism".
- McCarthy_Formalism sameAs Q6800189.
- McCarthy_Formalism sameAs m.0268b_b.
- McCarthy_Formalism sameAs Q6800189.
- McCarthy_Formalism wasDerivedFrom McCarthy_Formalism?oldid=653510194.
- McCarthy_Formalism isPrimaryTopicOf McCarthy_Formalism.