Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Effective_complexity> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- Effective_complexity abstract "Effective complexity is a measure of complexity defined in a 2003 paper by Murray Gell-Mann and Seth Lloyd that attempts to measure the amount of non-random information in a system. It has been criticised as being dependent on the subjective decisions made as to which parts of the information in the system are to be discounted as random.".
- Effective_complexity wikiPageExternalLink complex.maker.html.
- Effective_complexity wikiPageID "24811319".
- Effective_complexity wikiPageRevisionID "505774307".
- Effective_complexity hasPhotoCollection Effective_complexity.
- Effective_complexity subject Category:Computational_complexity_theory.
- Effective_complexity subject Category:Information_theory.
- Effective_complexity subject Category:Measures_of_complexity.
- Effective_complexity comment "Effective complexity is a measure of complexity defined in a 2003 paper by Murray Gell-Mann and Seth Lloyd that attempts to measure the amount of non-random information in a system. It has been criticised as being dependent on the subjective decisions made as to which parts of the information in the system are to be discounted as random.".
- Effective_complexity label "Effective complexity".
- Effective_complexity sameAs m.080b4p9.
- Effective_complexity sameAs Q5347249.
- Effective_complexity sameAs Q5347249.
- Effective_complexity wasDerivedFrom Effective_complexity?oldid=505774307.
- Effective_complexity isPrimaryTopicOf Effective_complexity.