Matches in DBpedia 2014 for { <http://dbpedia.org/resource/McCarthy_Formalism> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items 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 wikiPageID "7667818".
- McCarthy_Formalism wikiPageRevisionID "576818225".
- McCarthy_Formalism hasPhotoCollection McCarthy_Formalism.
- McCarthy_Formalism subject Category:Computability_theory.
- 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 m.0268b_b.
- McCarthy_Formalism sameAs Q6800189.
- McCarthy_Formalism sameAs Q6800189.
- McCarthy_Formalism wasDerivedFrom McCarthy_Formalism?oldid=576818225.
- McCarthy_Formalism isPrimaryTopicOf McCarthy_Formalism.