Klassifikation der Zufallsgesetze nach Komplexit�t und Ordnung
From MaRDI portal
Publication:5587565
DOI10.1007/BF00538763zbMath0192.53503MaRDI QIDQ5587565
Publication date: 1970
Published in: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete (Search for Journal in Brave)
Related Items (12)
Scaled dimension and nonuniform complexity ⋮ Equivalence of measures of complexity classes ⋮ Weakly complete problems are not rare ⋮ A unified approach to the definition of random sequences ⋮ Complexity of algorithms and computations ⋮ Capital Process and Optimality Properties of a Bayesian Skeptic in Coin-Tossing Games ⋮ Cook versus Karp-Levin: Separating completeness notions if NP is not small ⋮ Weak completeness in \(\text{E}\) and \(\text{E}_{2}\) ⋮ Almost everywhere high nonuniform complexity ⋮ A Characterization of Constructive Dimension ⋮ Genericity and randomness over feasible probability measures ⋮ A stronger Kolmogorov zero-one law for resource-bounded measure
Cites Work
- On the Computational Complexity of Algorithms
- A Machine-Independent Theory of the Complexity of Recursive Functions
- [https://portal.mardi4nfdi.de/wiki/Publication:5581622 Eine Bemerkung zum Begriff der zuf�lligen Folge]
- [https://portal.mardi4nfdi.de/wiki/Publication:5617399 �ber die Definition von effektiven Zufallstests]
- Komplexität von Algorithmen mit Anwendung auf die Analysis
- One-tape, off-line Turing machine computations
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Klassifikation der Zufallsgesetze nach Komplexit�t und Ordnung
