This HTML5 document contains 151 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/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
n19http://dbpedia.org/resource/Wiktionary:
foafhttp://xmlns.com/foaf/0.1/
dbpedia-globalhttps://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n12https://archive.org/details/darwinsdangerous0000denn%7Curl-access=registration%7Cpublisher=Touchstone/
freebasehttp://rdf.freebase.com/ns/
n21http://research.microsoft.com/~gurevich/Opera/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n15https://archive.org/details/
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#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Algorithm
dbo:wikiPageWikiLink
dbr:Algorithm_characterizations
Subject Item
dbr:Register_machine
dbo:wikiPageWikiLink
dbr:Algorithm_characterizations
Subject Item
dbr:Algorithmic_bias
dbo:wikiPageWikiLink
dbr:Algorithm_characterizations
Subject Item
dbr:History_of_the_Church–Turing_thesis
dbo:wikiPageWikiLink
dbr:Algorithm_characterizations
Subject Item
dbr:Algorithm_characterizations
owl:sameAs
freebase:m.0gw83t dbpedia-global:4NfZS yago-res:Algorithm_characterizations wikidata:Q4724354
rdfs:label
Algorithm characterizations
prov:wasDerivedFrom
wikipedia-en:Algorithm_characterizations?oldid=1292124277&ns=0
dbo:description
attempts to formalize the concept of algorithms
dbo:wikiPageExternalLink
n12:Simon n15:computabilityuns0000davi%7Curl-access=registration%7Cpublisher=McGraw-Hill n15:computationfinit0000mins%7Curl-access=registration%7Cedition=First%7Cpublisher=Prentice-Hall, n15:consciousnesslan00john%7Curl-access=registration%7Cpublisher=Cambridge n21:141.pdf n21:164.pdf n15:undecidablebasic0000davi%7Curl-access=registration%7Cpublisher=Raven
dbo:wikiPageWikiLink
dbr:Michael_Sipser dbr:Taxonomy_(general) dbr:Gödel dbc:Computability_theory dbr:Turing's_Thesis dbr:K._Kunen dbr:Deterministic_algorithm dbr:Martin_Davis_(mathematician) dbr:Turing_complete dbr:Data_flow_diagram dbr:Turing_machines dbr:Super-exponentiation dbr:Jan_van_Leeuwen dbc:Models_of_computation dbr:Decision_tree dbr:Semantic dbr:Natural_number dbr:Alonzo_Church dbr:Jon_Barwise dbr:Mu-operator dbr:Primitive_recursive_function dbr:John_P._Burgess dbr:Hartley_Rogers,_Jr dbr:Pointer_machine dbr:Chinese_room dbr:M4_(computer_language) dbr:Intrinsic dbr:Rózsa_Péter dbr:Harry_R._Lewis dbr:Recursion dbr:Turing_machine_equivalents dbr:Computer dbr:Christos_H._Papadimitriou dbr:State_diagram dbr:Cantor's_diagonal_argument dbr:Mind dbr:Counter-machine_model dbr:Formal_grammar dbr:John_Venn dbr:George_Boolos dbr:John_Searle dbr:Yuri_Gurevich dbr:Logical_form dbr:A._A._Markov dbr:Daniel_Dennett dbr:Space_complexity dbr:Greatest_common_divisor dbr:Register_machine dbr:Boolean_equation dbr:MIX dbr:Formal_system dbr:Time_complexity dbr:Effectively_computable dbr:Μ_operator dbr:Kleene dbr:Universal_Turing_machine dbr:Formal_language dbr:Ackermann_function dbr:J._Barkley_Rosser dbr:Dynamic_semantics dbr:Containment_hierarchy dbr:Turing dbr:Counter_machine dbr:W._Stanley_Jevons dbr:Andrey_Markov_Jr. dbr:Complexity_class dbr:Algorithm dbr:Primitive_recursive n19:finite n19:generality dbr:Finite_state_machine dbr:Donald_Knuth dbr:Random-access_machine dbr:Abstract_machine dbr:Lambda_calculus dbr:Random-access_stored-program_machine dbc:Formal_methods dbr:Andreas_Blass dbr:Intuitionism dbr:Robert_Soare dbr:Programming_language dbr:H._J._Keisler dbr:Church's_thesis dbr:Church–Turing_Thesis dbr:Mu_recursive_function dbr:Turing_machine dbr:Computable_function dbr:Algorithm_examples dbr:Syntax dbr:Kurt_Gödel dbr:Darwin's_Dangerous_Idea dbr:Peter_van_Emde_Boas dbc:Algorithms dbr:Constructive_mathematics dbr:Computational_theory_of_mind dbr:Church_Thesis dbr:Euclidean_algorithm dbr:Machine_language dbr:Emil_Post dbr:C_preprocessor dbr:Robin_Gandy dbr:Wilhelm_Ackermann dbr:Post–Turing_machine dbr:Ian_Stewart_(mathematician) dbr:David_Berlinski dbr:Alan_Turing dbr:Syllogism dbr:Richard_Jeffrey dbr:Chomsky_hierarchy
dct:subject
dbc:Algorithms dbc:Formal_methods dbc:Models_of_computation dbc:Computability_theory
foaf:isPrimaryTopicOf
wikipedia-en:Algorithm_characterizations
dbp:wikiPageUsesTemplate
dbt:Harv dbt:Expand_section dbt:Harvnb dbt:ISBN dbt:Sic dbt:Hatnote dbt:Verth dbt:Blockquote dbt:Cite_journal dbt:Reflist dbt:Cite_book dbt:Short_description dbt:According_to_whom
dbp:sign
John Searle
dbp:text
Computation [...] is observer-relative, and this is because computation is defined in terms of symbol manipulation, but the notion of a 'symbol' is not a notion of physics or chemistry. Something is a symbol only if it is used, treated or regarded as a symbol. The Chinese room argument showed that semantics is not intrinsic to syntax. But what this shows is that syntax is not intrinsic to physics. [...] Something is a symbol only relative to some observer, user or agent who assigns a symbolic interpretation to it [...] you can assign a computational interpretation to anything. But if the question asks, "Is consciousness intrinsically computational?" the answer is: nothing is intrinsically computational [italics added for emphasis]. Computation exists only relative to some agent or observer who imposes a computational interpretation on some phenomenon. This is an obvious point. I should have seen it ten years ago but I did not.
gold:hypernym
dbr:Attempts
Subject Item
wikipedia-en:Algorithm_characterizations
foaf:primaryTopic
dbr:Algorithm_characterizations
Subject Item
dbr:Outline_of_computer_programming
dbo:wikiPageWikiLink
dbr:Algorithm_characterizations
Subject Item
dbr:Algorithmic_technique
dbo:wikiPageWikiLink
dbr:Algorithm_characterizations