COMPUTABLE DOWD-TYPE GENERIC ORACLES

DOI10.1142/9789814360548_0008zbMath1280.03046OpenAlexW2319654958MaRDI QIDQ4922664

Toshio Suzuki, Masahiro Kumabe

Publication date: 3 June 2013

Published in: Proceedings of the 11th Asian Logic Conference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789814360548_0008

zbMATH Keywords

computational complexityrelativizationeffective randomnessgeneric oraclesDowd-genericity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32) Generic absoluteness and forcing axioms (03E57)

Related Items (1)

Resource-bounded martingales and computable Dowd-type generic sets

This page was built for publication: COMPUTABLE DOWD-TYPE GENERIC ORACLES