A Simple Measure of Complexity

Nature 336 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,122

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Is multi-tasking complex?W. Bentley MacLeod - 1998 - Behavioral and Brain Sciences 21 (6):840-841.
Incomplete Contracts and Complexity Costs.Luca Anderlini & Leonardo Felli - 1999 - Theory and Decision 46 (1):23-50.
Effective complexity as a measure of information content.James W. McAllister - 2003 - Philosophy of Science 70 (2):302-307.
An intersubjective measure of organizational complexity: A new approach to the study of complexity in organizations.Mihnea Moldoveanu - 2004 - Emergence: Complexity and Organization 6 (3).
The architecture of complexity: A new blueprint.Peter Turney - 1989 - Synthese 79 (3):515 - 542.
Simple Lives, Cultural Complexity: Rethinking Culture in Terms of Complexity Theory.Steen Bergendorff - 2009 - Lexington Books.
On Some Complexity Characteristics of Immune Sets.Valeriy K. Bulitko - 1995 - Mathematical Logic Quarterly 41 (3):307-313.
A Simple Model of Secure Public Communication.Hannu Vartiainen - 2009 - Theory and Decision 67 (1):101-122.
Uncomputably Noisy Ergodic Limits.Jeremy Avigad - 2012 - Notre Dame Journal of Formal Logic 53 (3):347-350.
Measure independent Gödel speed‐ups and the relative difficulty of recognizing sets.Martin K. Solomon - 1993 - Mathematical Logic Quarterly 39 (1):384-392.
Complexity: Plain and simple.Seth Lloyd - 1999 - Complexity 4 (4):72-72.
Simple Fusion with Low Complexity for Distributed Multitarget Classification in Wireless Sensor Networks.Kwanglak Jung, Jintae Park & Kiseon Kim - 2007 - Complexity 6:7.
Towards the computational complexity of ℘Rω-terms.Karl-Heinz Niggl - 1995 - Annals of Pure and Applied Logic 75 (1):153-178.
Towards the computational complexity of ℘Rω-terms.Karl-Heinz Niggl - 1995 - Annals of Pure and Applied Logic 75 (1-2):153-178.
Approximation to measurable functions and its relation to probabilistic computation.Ker-I. Ko - 1986 - Annals of Pure and Applied Logic 30 (2):173-200.

Analytics

Added to PP
2016-02-10

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Complexity and evolution: What everybody knows.Daniel W. McShea - 1991 - Biology and Philosophy 6 (3):303-324.
Explaining emergence: Toward an ontology of levels. [REVIEW]Claus Emmeche, Simo Koppe & Frederick Stjernfelt - 1997 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 28 (1):83-119.

View all 7 citations / Add more citations

References found in this work

No references found.

Add more references