This HTML5 document contains 60 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/
n10http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n17https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n19https://web.archive.org/web/20080603221058/http:/www.br-online.de/bayerisches-fernsehen/faszination-wissen/
freebasehttp://rdf.freebase.com/ns/
n18http://www.idsia.ch/~juergen/
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#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Low-complexity_art
rdf:type
dbo:Person
rdfs:label
Low-complexity art
rdfs:comment
Low-complexity art, first described by Jürgen Schmidhuber in 1997 and now established as a seminal topic within the larger field of computer science, is art that can be described by a short computer program (that is, a computer program of small Kolmogorov complexity).
dcterms:subject
dbc:Computer_art dbc:Computational_complexity_theory
dbo:wikiPageID
405489
dbo:wikiPageRevisionID
1077645722
dbo:wikiPageWikiLink
dbr:Algorithmic_art dbr:Subjectivity dbr:Formal_language dbr:Algorithmic_composition dbr:Algorithmic_information_theory dbr:Mathematician dbr:Infinite_compositions_of_analytic_functions dbr:Kolmogorov_complexity dbr:Curiosity dbr:Procedural_generation dbr:First_derivative dbr:Jürgen_Schmidhuber dbr:Interesting dbr:Minimum_description_length dbr:Fractal dbr:C_programming_language dbr:Continuum_(theory) dbr:Minimalism n10:Bytebeat.ogv dbc:Computational_complexity_theory dbc:Computer_art dbr:Beauty dbr:Demoscene dbr:Max_Bill dbr:Albrecht_Dürer dbr:Demo_(computer_programming) dbr:Symmetries dbr:Observation dbr:Geometric_abstraction dbr:Georges_Vantongerloo dbr:Predictability dbr:Mathematical_beauty dbr:Leonardo_da_Vinci dbr:Aesthetics dbr:Compressibility dbr:Art dbr:Self-similarity dbr:Neural_network dbr:Artificial_agents dbr:Reinforcement_learning
dbo:wikiPageExternalLink
n18:beauty.html n18:interest.html n19:schoenheit--aesthetik-wahrnehmung-ID1212005092828.xml
owl:sameAs
freebase:m.024cj3 wikidata:Q6692726 n17:4qesw
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:By_whom
dbo:abstract
Low-complexity art, first described by Jürgen Schmidhuber in 1997 and now established as a seminal topic within the larger field of computer science, is art that can be described by a short computer program (that is, a computer program of small Kolmogorov complexity).
gold:hypernym
dbr:Art
prov:wasDerivedFrom
wikipedia-en:Low-complexity_art?oldid=1077645722&ns=0
dbo:wikiPageLength
8822
foaf:isPrimaryTopicOf
wikipedia-en:Low-complexity_art