COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY
From MaRDI portal
Cites work
- A Machine-Independent Theory of the Complexity of Recursive Functions
- A New Interpretation of the von Mises' Concept of Random Sequence
- Abstract computational complexity and cycling computations
- scientific article; zbMATH DE number 3125691 (Why is no real title available?)
- scientific article; zbMATH DE number 3136643 (Why is no real title available?)
- scientific article; zbMATH DE number 3307591 (Why is no real title available?)
- scientific article; zbMATH DE number 3319968 (Why is no real title available?)
- scientific article; zbMATH DE number 3371888 (Why is no real title available?)
- OBJECTS
- On existence and existential perception
- On the concept of a random sequence
- Sentences undecidable in formalized arithmetic. An exposition of the theory of Kurt Gödel
- THINGS†
Cited in
(10)- Where do we stand on measures of uncertainty, ambiguity, fuzziness, and the like?
- PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part II: Static Complexity
- High end complexity
- SOME FOUNDATIONAL VIEWS ON GENERAL SYSTEMS AND THE HEMPEL PARADOX
- A MATHEMATICAL THEORY OF DESIGN Modeling the Design Process (Part II)
- A test for randomness based on a complexity measure
- COMPLEXITY AS A MEASURE OF THE DIFFICULTY OF SYSTEM DIAGNOSIS
- Complexity of quantum-mechanical evolutions from probability amplitudes
- On the syntactic structure of protein sequences and the concept of grammar complexity
- How should complexity scale with system size?
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)
