Výsledky vyhľadávania - "queries to a non-recursive oracle"
-
1
Autori: Stephan, Frank
Zdroj: Annals of Pure and Applied Logic. 94:273-296
Predmety: ddc:004, Recursively (computably) enumerable sets and degrees, queries to a non-recursive oracle, Logic, DATA processing & computer science, Learning and adaptive systems in artificial intelligence, Computational learning theory, Turing degrees, 0102 computer and information sciences, 01 natural sciences, logical queries, Applications of computability and recursion theory, inductive inference, Other degrees and reducibilities in computability and recursion theory, models of queries to a teacher, 0101 mathematics, query-inference degrees
Popis súboru: application/xml; application/pdf
Prístupová URL adresa: https://publikationen.bibliothek.kit.edu/216895/2067
https://zbmath.org/1308090
https://doi.org/10.1016/s0168-0072(97)00077-8
https://publikationen.bibliothek.kit.edu/216895
https://dblp.uni-trier.de/db/conf/colt/colt1995.html#Stephan95
http://portal.acm.org/citation.cfm?doid=225298.225317
http://dblp.uni-trier.de/db/conf/colt/colt1995.html#Stephan95
https://dl.acm.org/doi/10.1145/225298.225317
https://www.sciencedirect.com/science/article/pii/S0168007297000778
https://dblp.uni-trier.de/db/journals/apal/apal94.html#Stephan98
https://www.sciencedirect.com/science/article/abs/pii/S0168007297000778
http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:swb:90-AAA2168956
https://publikationen.bibliothek.kit.edu/216895/2067
https://publikationen.bibliothek.kit.edu/216895
https://doi.org/10.5445/IR/216895
Full Text Finder
Nájsť tento článok vo Web of Science