Resource-bounded martingales and computable Dowd-type generic sets
From MaRDI portal
Publication:2346413
DOI10.1016/j.ic.2015.03.004zbMath1320.03075OpenAlexW2018871662MaRDI QIDQ2346413
Masahiro Kumabe, Toshio Suzuki
Publication date: 1 June 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.03.004
Cites Work
- Does truth-table of linear norm reduce the one-query tautologies to a random oracle?
- Generic oracles, uniform machines, and codes
- Almost everywhere high nonuniform complexity
- Genericity and measure for exponential time
- Resource bounded randomness and weakly complete problems
- Forcing complexity: Minimum sizes of forcing conditions.
- Degrees of Dowd-type generic oracles
- Complexity of the \(r\)-query tautologies in the presence of a generic oracle
- Computing queries with higher-order logics
- Bounded truth table does not reduce the one-query tautologies to a random oracle
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Algorithmic Randomness and Complexity
- Calibrating Randomness
- Category and Measure in Complexity Classes
- Resource-bounded balanced genericity, stochasticity and weak randomness
- COMPUTABLE DOWD-TYPE GENERIC ORACLES
- A unified approach to the definition of random sequences
- The definition of random sequences
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Resource-bounded martingales and computable Dowd-type generic sets
