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

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

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
n8https://www.youtube.com/
dbohttp://dbpedia.org/ontology/
n20http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n11https://ghostarchive.org/varchive/youtube/20211221/
n17https://tromp.github.io/cl/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n9http://www.ioccc.org/2012/tromp/
n14http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n19https://writings.stephenwolfram.com/2020/12/combinators-a-centennial-view/%7Curl-status=live%7Caccess-date=2021-02-17%7Cwebsite=writings.stephenwolfram.com%7Clanguage=en%7Carchive-url=https:/web.archive.org/web/20201206200216/https:/writings.stephenwolfram.com/2020/12/combinators-a-centennial-view/
owlhttp://www.w3.org/2002/07/owl#
n16http://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Binary_combinatory_logic
rdf:type
dbo:Drug
rdfs:label
Binary combinatory logic
rdfs:comment
Binary combinatory logic (BCL) is a computer programming language that uses binary terms 0 and 1 to create a complete formulation of combinatory logic using only the symbols 0 and 1. Using the S and K combinators, complex boolean algebra functions can be made. BCL has applications in the theory of program-size complexity (Kolmogorov complexity).
owl:sameAs
freebase:m.071rr4
dbp:wikiPageUsesTemplate
dbt:Cite_journal dbt:Cite_web dbt:Reflist dbt:Cbignore dbt:Context
dct:subject
dbc:Algorithmic_information_theory dbc:Combinatory_logic
dbo:wikiPageExternalLink
n8:watch%3Fv=koqL2nfrNAE&list=PLi8_XqluS5xc7GL-bgVrxpA2Uww6nK0gV n9:hint.html n11:koqL2nfrNAE n17:cl.html n19:
dbo:thumbnail
n14:Rule_110_SK_Basis.png?width=300
foaf:depiction
n14:Rule_110_SK_Basis.png
gold:hypernym
dbr:Formulation
prov:wasDerivedFrom
n16:Binary_combinatory_logic?oldid=1074047948&ns=0
dbo:wikiPageID
2296426
dbo:wikiPageLength
4769
dbo:wikiPageRevisionID
1074047948
dbo:wikiPageWikiLink
dbr:Combinatory_logic dbr:Turing_completeness dbr:Denotational_semantics dbr:Turing_machine dbr:Operational_semantics dbr:Rewriting dbr:Iota_and_Jot dbr:Programming_language dbr:Cellular_automaton dbr:SKI_combinator_calculus dbr:Kolmogorov_complexity dbr:Backus–Naur_form dbc:Algorithmic_information_theory dbc:Combinatory_logic n20:Rule_110_SK_Basis.png dbr:Parsing
dbo:abstract
Binary combinatory logic (BCL) is a computer programming language that uses binary terms 0 and 1 to create a complete formulation of combinatory logic using only the symbols 0 and 1. Using the S and K combinators, complex boolean algebra functions can be made. BCL has applications in the theory of program-size complexity (Kolmogorov complexity).
foaf:isPrimaryTopicOf
n16:Binary_combinatory_logic