scientific article; zbMATH DE number 3823755

MaRDI QIDQ3671142zbMATH OpenFDO

Authors Ion Chiţescu, Cristian S. Calude

Publication date 1982

zbMATH Keywords

Kolmogorov complexityMartin-Loef testrandom string

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Axioms; other general questions in probability (60A05) Analysis of algorithms and problem complexity (68Q25)

Cited in

(2)

• Note on the topological structure of random strings
• On relativizations with restricted number of accesses to the oracle set

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671142)