Randomness and universal machines (Q864423)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Randomness and universal machines	scientific article

Statements

scholarly article

Randomness and universal machines (English)

Santiago Figueira

Journal of Complexity

publication date

8 February 2007

zbMATH Keywords

recursion theory

algorithmic randomness

Kolmogorov complexity

halting probability

\(\Omega\)-numbers

universal machines

truth-table degrees

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.jco.2006.05.001

Program size complexity for possibly infinite computations

Randomness and halting probabilities

Random reals and possibly infinite computations Part I: Randomness in ∅′

Recursively enumerable reals and Chaitin \(\Omega\) numbers

A Theory of Program Size Formally Identical to Information Theory

Algorithmic Randomness and Complexity

Calibrating Randomness

RELATIVIZING CHAITIN'S HALTING PROBABILITY

Using random sets as oracles

The degrees of bi‐immune sets

∏ 0 1 Classes and Degrees of Theories

Randomness and Recursive Enumerability

The definition of random sequences

Randomness and Computability: Open Questions

The Degrees of Hyperimmune Sets

Lowness properties and randomness

Randomness, relativization and Turing degrees

Classical recursion theory. The theory of functions and sets of natural numbers

Computing and Combinatorics

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

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:864423

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