This HTML5 document contains 51 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
n16http://www-formal.stanford.edu/jmc/
foafhttp://xmlns.com/foaf/0.1/
n14https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:McCarthy_Formalism
rdfs:label
McCarthy Formalism
rdfs: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.
dcterms:subject
dbc:Computability_theory
dbo:wikiPageID
7667818
dbo:wikiPageRevisionID
1013297374
dbo:wikiPageWikiLink
dbr:Association_list dbr:Mutually_exclusive dbr:Disjunction dbr:Mathematical_induction dbr:Karnaugh_map dbr:Identity_relation dbr:Mu-operator dbr:De_Bruijn_index dbr:Computer dbr:Multiplexer dbr:Marvin_Minsky dbr:Propositional_formula dbr:Richard_C._Jeffrey dbr:John_P._Burgess dbr:Propositional_logic dbr:Case_statement dbr:Primitive_recursive_function dbr:John_McCarthy_(computer_scientist) dbr:Primitive_recursive dbr:Recursion_(computer_science) dbc:Computability_theory dbr:Computer_science dbr:Logical_conjunction dbr:Truth_table dbr:Graph_relation dbr:Substitution_of_variables dbr:George_S._Boolos dbr:Negation dbr:Universal_quantification dbr:Recursion_theory dbr:Stephen_Kleene dbr:Recursion dbr:Primitive_recursion dbr:Existential_quantification dbr:Collectively_exhaustive
dbo:wikiPageExternalLink
n16:basis.html
owl:sameAs
wikidata:Q6800189 freebase:m.0268b_b n14:4rdow
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Isbn dbt:Math
dbo: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.
prov:wasDerivedFrom
wikipedia-en:McCarthy_Formalism?oldid=1013297374&ns=0
dbo:wikiPageLength
8835
foaf:isPrimaryTopicOf
wikipedia-en:McCarthy_Formalism