COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY
From MaRDI portal
Publication:4152080
DOI10.1080/03081077708934766zbMATH Open0374.93002OpenAlexW2025729703MaRDI QIDQ4152080FDOQ4152080
Authors: Lars Löfgren 
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- On the concept of a random sequence
- Title not available (Why is that?)
- A New Interpretation of the von Mises' Concept of Random Sequence
- OBJECTS
- Sentences undecidable in formalized arithmetic. An exposition of the theory of Kurt Gödel
- Title not available (Why is that?)
- Abstract computational complexity and cycling computations
- Title not available (Why is that?)
- On existence and existential perception
- THINGS†
Cited In (10)
- Where do we stand on measures of uncertainty, ambiguity, fuzziness, and the like?
- A MATHEMATICAL THEORY OF DESIGN Modeling the Design Process (Part II)
- High end complexity
- PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part II: Static Complexity
- On the syntactic structure of protein sequences and the concept of grammar complexity
- How should complexity scale with system size?
- SOME FOUNDATIONAL VIEWS ON GENERAL SYSTEMS AND THE HEMPEL PARADOX
- COMPLEXITY AS A MEASURE OF THE DIFFICULTY OF SYSTEM DIAGNOSIS
- A test for randomness based on a complexity measure
- Complexity of quantum-mechanical evolutions from probability amplitudes
This page was built for publication: COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4152080)
