Výsledky vyhledávání - "Other degrees and reducibilities in computability and recursion theory"

Control Structures in Computable Numberings and the Completion Operator: Control structures in computable numberings and the completion operator

Autoři: Faizrahmanov, Marat

Zdroj: Theory of Computing Systems. 69

Témata: computable numbering, complete numbering, Other degrees and reducibilities in computability and recursion theory, completion, universal numbering, Theory of numerations, effectively presented structures, principal numbering, Recursive functions and relations, subrecursive hierarchies

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/8037355
https://doi.org/10.1007/s00224-025-10222-1

On a General Method of Constructing Post Reducibilities and the Corresponding Completeness Criteria: On a general method of constructing post reducibilities and the corresponding completeness criteria

Autoři: Arslanov, M. M.

Zdroj: Lobachevskii Journal of Mathematics. 43:3430-3434

Témata: \(m\)-reducibility, \(Q\)-reducibility, Recursively (computably) enumerable sets and degrees, Other degrees and reducibilities in computability and recursion theory, completeness criterion, \(tt\)-reducibility, Turing reducibility, fixed points of function

Popis souboru: application/xml

Topological reducibilities for discontinuous functions and their structures

Autoři: Kihara, Takayuki

Zdroj: Israel Journal of Mathematics. 252:461-500

Témata: Determinacy principles, 03D30, 03E15, 03E60, 03D55, 26A21, General Topology (math.GN), FOS: Mathematics, Other degrees and reducibilities in computability and recursion theory, Mathematics - Logic, 0101 mathematics, Logic (math.LO), Descriptive set theory, 01 natural sciences, Mathematics - General Topology

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/1906.10573

Completeness Criteria for a Class of Reducibilities: Completeness criteria for a class of reducibilities

Autoři: Arslanov, M. M.

Zdroj: Russian Mathematics. 66:62-66

Témata: m-reducibility, Q-reducibility, Other Turing degree structures, Other degrees and reducibilities in computability and recursion theory, completeness criterion, 0101 mathematics, 01 natural sciences, Turing reducibility, tt-reducibility, fixed points of function

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/7659051
https://doi.org/10.3103/s1066369x22100012

Integer-Valued Martingales and Cl-Turing Reductions: Integer-valued martingales and cl-Turing reductions

Autoři: Nan Fang Lu Liu Liang Yu

Zdroj: Theoretical Computer Science. 1040:115202

Témata: algorithmic randomness, integer-valued randomness, martingale, Algorithmic randomness and dimension, integer-valued martingale, Other degrees and reducibilities in computability and recursion theory, cl-Turing reducibility, cl-tt-reduction, Algorithmic information theory (Kolmogorov complexity, etc.)

Popis souboru: application/xml

A Reducibility for the Dot-Depth Hierarchy: A reducibility for the dot-depth hierarchy

Autoři: Victor L. Selivanov Klaus W. Wagner

Zdroj: Lecture Notes in Computer Science ISBN: 9783540228233

Témata: Complexity of computation (including implicit computational complexity), Complete sets, 0102 computer and information sciences, 01 natural sciences, Hierarchies of computability and definability, Theoretical Computer Science, Other degrees and reducibilities in computability and recursion theory, Complexity classes (hierarchies, relations among complexity classes, etc.), Leaf languages, Dot-depth hierarchy, 0101 mathematics, Reducibility, Degree structure, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/2235842
https://doi.org/10.1016/j.tcs.2005.07.020
https://core.ac.uk/display/82049108
https://www.sciencedirect.com/science/article/pii/S0304397505004068
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2004.html#SelivanovW04
https://link.springer.com/chapter/10.1007/978-3-540-28629-5_61
https://rd.springer.com/chapter/10.1007/978-3-540-28629-5_61

Randomness, Computability, and Density: Randomness, computability, and density

Autoři: Denis R. Hirschfeldt Rodney G. Downey André Nies

Zdroj: Lecture Notes in Computer Science ISBN: 9783540416951

Témata: Applications of computability and recursion theory, Other degrees and reducibilities in computability and recursion theory, randomness, Kolmogorov complexity, 0102 computer and information sciences, 0101 mathematics, Solovay reducibility, 01 natural sciences, computably enumerable reals, algorithmic information theory, Algorithmic information theory (Kolmogorov complexity, etc.)

Popis souboru: application/xml

Přístupová URL adresa: http://math.uchicago.edu/~drh/Papers/Papers/cereals.pdf
https://dblp.uni-trier.de/db/conf/stacs/stacs2001.html#DowneyHN01
https://link.springer.com/10.1007/3-540-44693-1_17
https://link.springer.com/chapter/10.1007%2F3-540-44693-1_17
https://rd.springer.com/chapter/10.1007/3-540-44693-1_17
https://epubs.siam.org/doi/abs/10.1137/S0097539700376937
https://locus.siam.org/doi/abs/10.1137/S0097539700376937
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp31.html#DowneyHN02

Randomness and Reductibility: Randomness and reducibility

Autoři: Rodney G. Downey Denis R. Hirschfeldt Geoff La Forte

Zdroj: Lecture Notes in Computer Science ISBN: 9783540424963

Témata: Computer Networks and Communications, Applied Mathematics, Kolmogorov complexity, 0102 computer and information sciences, Algorithmic information theory, Solovay reducibility, 01 natural sciences, Algorithmic information theory (Kolmogorov complexity, etc.), Theoretical Computer Science, Relative randomness, Computational Theory and Mathematics, Applications of computability and recursion theory, Other degrees and reducibilities in computability and recursion theory, 0101 mathematics, Computably enumerable reals, domination

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/2099264
https://doi.org/10.1016/j.jcss.2003.07.004
https://dblp.uni-trier.de/db/journals/jcss/jcss68.html#DowneyHL04
https://www.sciencedirect.com/science/article/pii/S0022000003001314
https://core.ac.uk/display/82176402
https://link.springer.com/chapter/10.1007/3-540-44683-4_28
https://rd.springer.com/chapter/10.1007/3-540-44683-4_28

Almost complete sets: Almost complete sets.

Autoři: Sebastiaan A. Terwijn Wolfgang Merkle Klaus Ambos-Spies a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783540671411

Témata: Completeness, almost completeness, Complexity of computation (including implicit computational complexity), many-one reductions, Weak completeness, Resource-bounded measure, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, 02 engineering and technology, weak completeness, 1-tt-reductions, 01 natural sciences, Many-one reductions, Theoretical Computer Science, Resource-bounded reducibilities, resource-bounded measure, Almost completeness, 0202 electrical engineering, electronic engineering, information engineering, Other degrees and reducibilities in computability and recursion theory, Complexity classes (hierarchies, relations among complexity classes, etc.), length-increasing one-one reductions, resource-bounded reducibilities, Length-increasing one–one reductions, Computer Science(all)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/2056796
https://doi.org/10.1016/s0304-3975(03)00262-7
https://link.springer.com/content/pdf/10.1007%2F3-540-46541-3_35.pdf
https://dblp.uni-trier.de/db/conf/stacs/stacs2000.html#Ambos-SpiesMRT00
https://pennstate.pure.elsevier.com/en/publications/almost-complete-sets
https://core.ac.uk/display/24726842
https://link.springer.com/chapter/10.1007%2F3-540-46541-3_35
https://rd.springer.com/chapter/10.1007/3-540-46541-3_35
https://dblp.uni-trier.de/db/journals/tcs/tcs306.html#Ambos-SpiesMRT03
https://www.sciencedirect.com/science/article/pii/S0304397503002627
https://pennstate.pure.elsevier.com/en/publications/almost-complete-sets-2
https://math.uni-heidelberg.de/logic/merkle/final-versions/TCS-almcomp.pdf
https://doi.org/10.1016/S0304-3975(03)00262-7

The Global Power of Additional Queries to p-Random Oracles: The global power of additional queries to \(p\)-random oracles

Autoři: Wolfgang Merkle

Zdroj: Lecture Notes in Computer Science ISBN: 9783540677154

Témata: Complexity of computation (including implicit computational complexity), 4. Education, random oracles, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, random sets, Algorithmic information theory (Kolmogorov complexity, etc.), bounded truth-table reducibility, 0202 electrical engineering, electronic engineering, information engineering, Other degrees and reducibilities in computability and recursion theory, Complexity classes (hierarchies, relations among complexity classes, etc.), effective measure, query complexity, resource-bounded reducibilities, effective reducibilities, separation of reducibilities, resource bounded measure

Popis souboru: application/xml

Přístupová URL adresa: https://dblp.uni-trier.de/db/conf/icalp/icalp2000.html#Merkle00
https://link.springer.com/content/pdf/10.1007%2F3-540-45022-X_77.pdf
https://link.springer.com/chapter/10.1007/3-540-45022-X_77
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp31.html#Merkle01
https://rd.springer.com/chapter/10.1007/3-540-45022-X_77
https://locus.siam.org/doi/abs/10.1137/S0097539700366711
http://math.uni-heidelberg.de/logic/merkle/ps/SICOMP-global.pdf
https://epubs.siam.org/doi/pdf/10.1137/S0097539700366711
https://math.uni-heidelberg.de/logic/merkle/ps/SICOMP-global.pdf

Structure in Approximation Classes: Structure in approximation classes

Autoři: CRESCENZI, PIERLUIGI V. KANN R. SILVESTRI a další

Zdroj: SIAM Journal on Computing. 28:1759-1782

Témata: APX-intermediate problems, approximation classes, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Approximation algorithms, reducibilities, complexity classes, NPO-complete problems, complexity classes, reducibilities, approximation algorithms, Algorithms, Computation theory, Functions, Optimization, Polynomials, Complexity classes (hierarchies, relations among complexity classes, etc.), Other degrees and reducibilities in computability and recursion theory, approximation algorithms

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1354459
https://doi.org/10.1137/s0097539796304220
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp28.html#CrescenziKST99
https://epubs.siam.org/doi/abs/10.1137/S0097539796304220
https://rd.springer.com/chapter/10.1007/BFb0030875
https://epubs.siam.org/doi/pdf/10.1137/S0097539796304220
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000080710200010&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a
https://doi.org/10.1137/S0097539796304220
https://hdl.handle.net/11573/48862
https://hdl.handle.net/2158/205987
https://doi.org/10.1137/S0097539796304220

Exact pairs for abstract bounded reducibilities

Autoři: Wolfgang Merkle

Zdroj: Lecture Notes in Computer Science ISBN: 9783540631729

Témata: resource bounded reducibilities, Other degrees and reducibilities in computability and recursion theory, exact pairs, abstract reducibilities, 0102 computer and information sciences, minimal pair of recursive sets, 0101 mathematics, 01 natural sciences, 7. Clean energy

Popis souboru: application/xml

Přístupová URL adresa: https://link.springer.com/chapter/10.1007%2F3-540-63172-0_49
https://link.springer.com/content/pdf/10.1007%2F3-540-63172-0_49.pdf
https://rd.springer.com/chapter/10.1007/3-540-63172-0_49
https://dblp.uni-trier.de/db/conf/csl/csl96.html#Merkle96
http://onlinelibrary.wiley.com/doi/10.1002/malq.19990450306/abstract
https://dblp.uni-trier.de/db/journals/mlq/mlq45.html#Merkle99

Learning via queries and oracles

Autoři: Stephan, Frank

Zdroj: Annals of Pure and Applied Logic. 94:273-296

Témata: 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 souboru: application/xml; application/pdf

Pří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

Separations by random oracles and 'Almost' classes for generalized reducibilities: Extended abstract

Autoři: Yongge Wang Wolfgang Merkle

Zdroj: Lecture Notes in Computer Science ISBN: 9783540602460

Témata: Complexity of computation (including implicit computational complexity), measurable classes of sets, Other degrees and reducibilities in computability and recursion theory, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), resource-bounded reducibilities, random oracles, almost classes, generalized reducibilities, 16. Peace & justice, Abstract and axiomatic computability and recursion theory

Popis souboru: application/xml

Přístupová URL adresa: https://dialnet.unirioja.es/servlet/articulo?codigo=2805273
https://dblp.uni-trier.de/db/journals/mlq/mlq47.html#MerkleW01
https://link.springer.com/chapter/10.1007%2F3-540-60246-1_124
https://dblp.uni-trier.de/db/conf/mfcs/mfcs95.html#MerkleW95
https://philpapers.org/rec/WANSBR
https://math.uni-heidelberg.de/logic/merkle/final-versions/MLQ-almost.pdf
https://rd.springer.com/chapter/10.1007/3-540-60246-1_124

The existence of high nonbounding degrees in the difference hierarchy

Autoři: Chong, C.T. Li, A. Yang, Y. a další

Přispěvatelé: Chong, C.T. Li, A. Yang, Y. a další

Zdroj: Annals of Pure and Applied Logic. 138:31-51

Témata: Recursively (computably) enumerable sets and degrees, Jump classes, Logic, Nonbounding, Other degrees and reducibilities in computability and recursion theory, d.c.e. degree, 0101 mathematics, Ershov hierarchy, 01 natural sciences, jump classes

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/2242222
https://doi.org/10.1016/j.apal.2005.06.005
https://www.sciencedirect.com/science/article/pii/S0168007205000862
https://www.sciencedirect.com/science/article/abs/pii/S0168007205000862
https://philpapers.org/rec/CHOTEO-3
https://dblp.uni-trier.de/db/journals/apal/apal138.html#ChongLY06
http://ir.iscas.ac.cn/handle/311060/12122
https://doi.org/10.1016/j.apal.2005.06.005

On the structure of partially ordered sets of Boolean degrees

Autoři: Sergey Seraphimovich Marchenkov

Zdroj: Discrete Mathematics and Applications. 16:87-97

Témata: Combinatorics of partially ordered sets, Switching theory, application of Boolean algebra, Boolean functions, Other degrees and reducibilities in computability and recursion theory, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, informational complexity

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/5062009
https://doi.org/10.1515/156939206776241237
http://www.ingentaselect.com/rpsv/cgi-bin/cgi?ini=xref&body=linker&reqdoi=10.1163/156939206776241237
https://www.degruyter.com/view/j/dma.2006.16.issue-1/156939206776241237/156939206776241237.pdf
http://www.degruyter.com/dg/viewarticle.layout.displayshoppingcartlink:shoppingcartinfolink?t:ac=j$002fdma.2006.16.issue-1$002f156939206776241237$002f156939206776241237.xml

Bounding and nonbounding minimal pairs in the enumeration degrees

Autoři: Cooper S. B. Li A. Sorbi A. a další

Přispěvatelé: Cooper S. B. Li A. Sorbi A. a další

Zdroj: J. Symbolic Logic 70, iss. 3 (2005), 741-766

Témata: minimal pair, Recursively (computably) enumerable sets and degrees, Enumeration degree, 0102 computer and information sciences, 16. Peace & justice, 01 natural sciences, Other degrees and reducibilities in computability and recursion theory, e-degree, s-degree, 0101 mathematics, 03D30

Popis souboru: application/xml; application/pdf; STAMPA

Přístupová URL adresa: https://www.maths.leeds.ac.uk/~pmt6sbc/preprints/minimal.pdf
https://core.ac.uk/display/53631513
https://dblp.uni-trier.de/db/journals/jsyml/jsyml70.html#CooperLSY05
https://projecteuclid.org/journals/journal-of-symbolic-logic/volume-70/issue-3/Bounding-and-nonbounding-minimal-pairs-in-the-enumeration-degrees/10.2178/jsl/1122038912.full
https://philpapers.org/rec/SBABAN
https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/bounding-and-nonbounding-minimal-pairs-in-the-enumeration-degrees/928A29E7594077EE5C39A03FC743A32A
http://projecteuclid.org/euclid.jsl/1122038912

Hypersimplicity and semicomputability in the weak truth table degrees

Autoři: George Barmpalias

Zdroj: Archive for Mathematical Logic. 44:1045-1065

Témata: Recursively (computably) enumerable sets and degrees, weak truth table degree, hypersimple sets, hypersimple degrees, computable orderings, Other degrees and reducibilities in computability and recursion theory, 0101 mathematics, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/2238613
https://doi.org/10.1007/s00153-005-0288-9

Minimal extensions of ?01 classes: Minimal extensions of \(\Pi^{0}_{1}\) classes

Autoři: Farzan Riazati Douglas Cenzer

Zdroj: MLQ. 51:206-216

Témata: Computability, Recursively (computably) enumerable sets and degrees, Other degrees and reducibilities in computability and recursion theory, 0101 mathematics, \(\Pi^0_1\) classes, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://dialnet.unirioja.es/servlet/articulo?codigo=2805628
https://philpapers.org/rec/CENMEO
http://onlinelibrary.wiley.com/doi/10.1002/malq.200410021/abstract
https://dblp.uni-trier.de/db/journals/mlq/mlq51.html#CenzerR05

The minimal e-degree problem in fragments of Peano arithmetic

Autoři: Arslanov, M.M. Chong, C.T. Cooper, S.B. a další

Přispěvatelé: Arslanov, M.M. Chong, C.T. Cooper, S.B. a další

Zdroj: SCOPUS01680072-2005-131-13-SID7244226325

Témata: First-order arithmetic and fragments, Models of arithmetic and set theory, Nonstandard models of arithmetic, Logic, \(\Sigma_2\)-collection, e-degrees, Other degrees and reducibilities in computability and recursion theory, fragments of arithemtic, 0101 mathematics, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://openrepository.ru/article?id=172491
https://openrepository.ru/article?id=130624
https://core.ac.uk/display/82827520
https://dblp.uni-trier.de/db/journals/apal/apal131.html#ArslanovCCY05
https://philpapers.org/rec/ARSTME
https://www.sciencedirect.com/science/article/pii/S0168007204000910