COMPLEXITY, INFORMATION, ENERGY (Q3526535)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	COMPLEXITY, INFORMATION, ENERGY	scientific article

Statements

scholarly article

0 references

COMPLEXITY, INFORMATION, ENERGY (English)

0 references

Helmut Jürgensen

0 references

International Journal of Foundations of Computer Science

0 references

publication date

25 September 2008

0 references

MaRDI profile type

MaRDI publication profile

0 references

Entropy and algorithmic complexity in quantum information theory

0 references

Theories of computational complexity

0 references

Is complexity a source of incompleteness?

0 references

Randomness relative to Cantor expansions

0 references

On partial randomness

0 references

0 references

Information-Theoretic Incompleteness

0 references

On the Length of Programs for Computing Finite Binary Sequences

0 references

A broader view on the limitations of information processing and communication by nature

0 references

0 references

The axiomatization of randomness

0 references

Entropy as a fixed point

0 references

The definition of random sequences

0 references

Randomness and Computability: Open Questions

0 references

Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)

0 references

Communication Theory of Secrecy Systems*

0 references

A Mathematical Theory of Communication

0 references

full work available at URL

https://doi.org/10.1142/s0129054108005954

0 references

Identifiers

zbMATH Open document ID

0 references

10.1142/S0129054108005954

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3526535

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