COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY
From MaRDI portal
Publication:4152080
DOI10.1080/03081077708934766zbMath0374.93002OpenAlexW2025729703MaRDI QIDQ4152080
Publication date: 1977
Published in: International Journal of General Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081077708934766
Related Items (10)
A MATHEMATICAL THEORY OF DESIGN Modeling the Design Process (Part II) ⋮ Where do we stand on measures of uncertainty, ambiguity, fuzziness, and the like? ⋮ A test for randomness based on a complexity measure ⋮ PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part II: Static Complexity ⋮ COMPLEXITY AS A MEASURE OF THE DIFFICULTY OF SYSTEM DIAGNOSIS ⋮ High end complexity ⋮ How should complexity scale with system size? ⋮ SOME FOUNDATIONAL VIEWS ON GENERAL SYSTEMS AND THE HEMPEL PARADOX ⋮ Complexity of quantum-mechanical evolutions from probability amplitudes ⋮ On the syntactic structure of protein sequences and the concept of grammar complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On existence and existential perception
- Abstract computational complexity and cycling computations
- Sentences undecidable in formalized arithmetic. An exposition of the theory of Kurt Gödel
- THINGS†
- OBJECTS
- A Machine-Independent Theory of the Complexity of Recursive Functions
- A New Interpretation of the von Mises' Concept of Random Sequence
- On the concept of a random sequence
This page was built for publication: COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY