On universal computably enumerable prefix codes (Q3616215)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On universal computably enumerable prefix codes	scientific article

Statements

scholarly article

0 references

On universal computably enumerable prefix codes (English)

0 references

0 references

Cristian S. Calude

0 references

Mathematical Structures in Computer Science

0 references

publication date

24 March 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

Computability and Randomness

0 references

Algorithmic Randomness and Complexity

0 references

Algorithmic Information Theory

0 references

THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS

0 references

Natural halting probabilities, partial randomness, and zeta functions

0 references

A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets

0 references

0 references

Kolmogorov complexity and Hausdorff dimension

0 references

On the entropy of context-free languages

0 references

full work available at URL

https://doi.org/10.1017/s0960129508007238

0 references

Identifiers

zbMATH Open document ID

0 references

10.1017/S0960129508007238

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3616215

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3616215&oldid=37310501"