On generalized Kolmogorov complexity
3rd annual symposium on theoretical aspects of computer science on STACS 86
Algorithmic information theory
Algorithmic information theory
Theories of computational complexity
Theories of computational complexity
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
Computability, complexity, and languages (2nd ed.): fundamentals of theoretical computer science
On the Length of Programs for Computing Finite Binary Sequences
Journal of the ACM (JACM)
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations
Journal of the ACM (JACM)
A Theory of Program Size Formally Identical to Information Theory
Journal of the ACM (JACM)
Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
Elements of the Theory of Computation
Elements of the Theory of Computation
On minimal-program complexity measures
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Algorithmic complexity of recursive and inductive algorithms
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Algorithmic complexity as a criterion of unsolvability
Theoretical Computer Science
Process complexity and effective random tests
Journal of Computer and System Sciences
Randomness behaviour in blum universal static complexity spaces
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
| Hi-index | 0.00 |
Dual complexity measures have been developed by Burgin, under the influence of the axiomatic system proposed by Blum in [3]. The concept of dual complexity measure is a generalization of Kolmogorov/Chaitin complexity, also known as algorithmic or static complexity. In this paper we continue this effort by extending some of the well known results for plain and prefix-free complexities to the general case of Blum universal static complexity. We also extend some results obtained by Calude in [9] to a larger class of computable measures, proving that transducer complexity is a dual (Blum static) complexity measure.