@prefix epid: .
@prefix dc: .
@prefix geo: .
@prefix bibo: .
@prefix epx: .
@prefix owl: .
@prefix void: .
@prefix event: .
@prefix skos: .
@prefix xsd: .
@prefix cc: .
@prefix ep: .
@prefix foaf: .
@prefix rdf: .
@prefix rdfs: .
@prefix eprel: .
@prefix dct: .
<>
foaf:primaryTopic ;
rdfs:comment "The repository administrator has not yet configured an RDF license."^^xsd:string .
rdfs:label "UGisug-20140411.pdf"^^xsd:string .
rdfs:label "lightbox.jpg"^^xsd:string .
rdfs:label "preview.jpg"^^xsd:string .
rdfs:label "medium.jpg"^^xsd:string .
rdfs:label "small.jpg"^^xsd:string .
rdfs:label "indexcodes.txt"^^xsd:string .
dc:format "text/html";
dc:title "HTML Summary of #9229 \n\nUniversal Grammar Is a Universal Grammar\n\n";
foaf:primaryTopic .
cc:license ;
dct:hasPart ;
ep:hasFile ;
rdf:type bibo:Document,
ep:Document;
rdfs:label "Universal Grammar Is a Universal Grammar (PDF)"^^xsd:string .
dct:hasPart ;
ep:hasFile ;
eprel:isVersionOf ;
eprel:isVolatileVersionOf ;
eprel:islightboxThumbnailVersionOf ;
rdf:type ep:Document;
rdfs:label "Universal Grammar Is a Universal Grammar (Other)"^^xsd:string .
dct:hasPart ;
ep:hasFile ;
eprel:isVersionOf ;
eprel:isVolatileVersionOf ;
eprel:ispreviewThumbnailVersionOf ;
rdf:type ep:Document;
rdfs:label "Universal Grammar Is a Universal Grammar (Other)"^^xsd:string .
dct:hasPart ;
ep:hasFile ;
eprel:isVersionOf ;
eprel:isVolatileVersionOf ;
eprel:ismediumThumbnailVersionOf ;
rdf:type ep:Document;
rdfs:label "Universal Grammar Is a Universal Grammar (Other)"^^xsd:string .
dct:hasPart ;
ep:hasFile ;
eprel:isVersionOf ;
eprel:isVolatileVersionOf ;
eprel:issmallThumbnailVersionOf ;
rdf:type ep:Document;
rdfs:label "Universal Grammar Is a Universal Grammar (Other)"^^xsd:string .
dct:hasPart ;
ep:hasFile ;
eprel:isIndexCodesVersionOf ;
eprel:isVersionOf ;
eprel:isVolatileVersionOf ;
rdf:type ep:Document;
rdfs:label "Universal Grammar Is a Universal Grammar (Other)"^^xsd:string .
rdf:_1 .
bibo:abstract "Is Universal Grammar a universal grammar? From Chomsky's hierarchy we deduce that for each grammar there is a Turing machine, and conversely. Following this equivalence, it is immediate to conclude that a universal Turing machine is equivalent to a universal grammar. Meanwhile, in linguistics, Universal Grammar is the human brain circuitry that implements the faculty of language. So the definitive answer is achieved only when we show that the human brain is Turing complete, and that language uses this capability. So yes: Universal Grammar is a universal grammar, because the human brain circuitry that implements the faculty of language is Turing complete."^^xsd:string;
bibo:authorList ;
bibo:status ;
dc:hasVersion ;
dct:creator ;
dct:date "2014-04-11";
dct:isPartOf ;
dct:subject ,
,
;
dct:title "Universal Grammar Is a Universal Grammar"^^xsd:string;
ep:hasDocument ,
,
,
,
,
;
ep:hasDraft ;
rdf:type bibo:Article,
ep:EPrint,
ep:PreprintEPrint;
rdfs:seeAlso .
rdf:type skos:Concept;
skos:prefLabel "Evolution" .
rdf:type skos:Concept;
skos:prefLabel "Language" .
rdf:type skos:Concept;
skos:prefLabel "Syntax" .
foaf:familyName "Casares"^^xsd:string;
foaf:givenName "Ramón"^^xsd:string;
foaf:name "Ramón Casares"^^xsd:string;
rdf:type foaf:Person .