https://openalex.org/T12002
This cluster of papers explores topics in computational complexity and algorithmic information theory, including Kolmogorov complexity, randomness, Turing machines, compression-based distance measures, universal intelligence, computational depth, fractal dimension, and causal discovery.
@prefix oasubfields: <https://openalex.org/subfields/> .
@prefix openalex: <https://lambdamusic.github.io/openalex-hacks/ontology/> .
@prefix owl: <http://www.w3.org/2002/07/owl#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
<https://openalex.org/T12002> a skos:Concept ;
rdfs:label "Computational Complexity and Algorithmic Information Theory"@en ;
rdfs:isDefinedBy openalex: ;
owl:sameAs <https://en.wikipedia.org/wiki/Computational_complexity_theory>,
<https://openalex.org/T12002> ;
skos:broader oasubfields:1703 ;
skos:definition "This cluster of papers explores topics in computational complexity and algorithmic information theory, including Kolmogorov complexity, randomness, Turing machines, compression-based distance measures, universal intelligence, computational depth, fractal dimension, and causal discovery."@en ;
skos:inScheme openalex: ;
skos:prefLabel "Computational Complexity and Algorithmic Information Theory"@en ;
openalex:cited_by_count 1040128 ;
openalex:works_count 68578 .