-
1Academic Journal
Authors: Faizrahmanov, Marat
Source: Theory of Computing Systems. 69
Subject Terms: 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
Linked Full TextFile Description: application/xml
-
2Academic Journal
Authors: Fernando C. Alves
Source: Journal of Logic, Language and Information. 32:363-372
Subject Terms: recursion theory, inductive inference, Computational learning theory, learning in the limit, Formal languages and automata, 06 humanities and the arts, 0101 mathematics, 0603 philosophy, ethics and religion, Word problems, etc. in computability and recursion theory, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Gold's theorem
File Description: application/xml
-
3Academic Journal
Authors: Marchenkov, S. S.
Source: Moscow University Computational Mathematics and Cybernetics. 46:197-203
Subject Terms: finite superposition basis, operation of bound prefix concatenation, Recursive functions and relations, subrecursive hierarchies
File Description: application/xml
-
4Academic Journal
Authors: Ongay-Valverde, IvánAff1, Aff2, Aff3, IDs00153023008657_cor1
Source: Archive for Mathematical Logic. :1-27
-
5Book
Authors: Jain, Sanjay, Menzel, Wolfram, Stephan, Frank
Contributors: COMPUTER SCIENCE
Source: Lecture Notes in Computer Science ISBN: 9783540001706
Subject Terms: ddc:004, DATA processing & computer science, Computational learning theory, 0102 computer and information sciences, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Theoretical Computer Science, Computer Science Applications, Computational Theory and Mathematics, 0101 mathematics, explanatory learning, Information Systems
File Description: application/xml
Access URL: https://zbmath.org/2083121
https://doi.org/10.1016/j.ic.2003.12.004
https://link.springer.com/chapter/10.1007%2F3-540-36169-3_19
https://dblp.uni-trier.de/db/conf/alt/alt2002.html#JainMS02
https://rd.springer.com/chapter/10.1007/3-540-36169-3_19
https://www.sciencedirect.com/science/article/pii/S0890540103002657
https://dblp.uni-trier.de/db/journals/iandc/iandc190.html#JainMS04
https://core.ac.uk/display/48662143
https://www.sciencedirect.com/science/article/abs/pii/S0890540103002657 -
6Academic Journal
Authors: Sanjay Jain, Frank Stephan
Source: Lecture Notes in Computer Science ISBN: 9783540428756
Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, Computational learning theory, total recursive functions, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theorem proving (deduction, resolution, etc.), Recursive functions and relations, subrecursive hierarchies, Theoretical Computer Science, Computer Science(all)
Linked Full TextFile Description: application/xml
-
7Academic Journal
Authors: Cervelle, Julien, Durand, Bruno
Contributors: Cervelle, Julien, Reichel Horst and Tison Sophie
Source: Lecture Notes in Computer Science ISBN: 9783540671411
Subject Terms: Cellular automata (computational aspects), Recursivity, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Combinatorics in computer science, Undecidability and degrees of sets of sentences, 0102 computer and information sciences, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Theoretical Computer Science, Tilings, Combinatorial aspects of tessellation and tiling problems, Quasiperiodicity, 0101 mathematics, Computer Science(all)
File Description: application/xml
Linked Full TextAccess URL: https://zbmath.org/2111067
https://doi.org/10.1016/s0304-3975(03)00242-1
https://dblp.uni-trier.de/db/journals/tcs/tcs310.html#CervelleD04
https://www.sciencedirect.com/science/article/pii/S0304397503002421
https://rd.springer.com/chapter/10.1007/3-540-46541-3_41
https://dblp.uni-trier.de/db/conf/stacs/stacs2000.html#CervelleD00
https://link.springer.com/chapter/10.1007%2F3-540-46541-3_41
https://hal.science/hal-00620184v1
https://hal.science/hal-00619517v1 -
8Academic Journal
Authors: Jain, S., Sharma, A.
Contributors: INFORMATION SYSTEMS & COMPUTER SCIENCE
Source: Lecture Notes in Computer Science ISBN: 9783540591191
Subject Terms: language learning machine, Learning and adaptive systems in artificial intelligence, 0202 electrical engineering, electronic engineering, information engineering, Formal languages and automata, 0102 computer and information sciences, 02 engineering and technology, reducibility, Automata and formal grammars in connection with logical questions, 16. Peace & justice, 01 natural sciences, intrinsic complexity of learning, Recursive functions and relations, subrecursive hierarchies
File Description: application/xml
Access URL: http://www.comp.nus.edu.sg/~sanjay/paps/intrin.pdf
https://zbmath.org/1130649
https://doi.org/10.2307/2275636
https://www.cambridge.org/core/journals/journal-of-symbolic-logic/article/structure-of-intrinsic-complexity-of-learning/49852E55760DEE91348694D5AE3DD45E
https://projecteuclid.org/euclid.jsl/1183745375
http://projecteuclid.org/euclid.jsl/1183745375
https://core.ac.uk/display/20721385
https://dblp.uni-trier.de/db/journals/jsyml/jsyml62.html#JainS97
https://philpapers.org/rec/JAITSO
https://link.springer.com/content/pdf/10.1007/3-540-59119-2_176.pdf
https://link.springer.com/chapter/10.1007/3-540-59119-2_176
https://rd.springer.com/chapter/10.1007%2F3-540-59119-2_176
https://dblp.uni-trier.de/db/conf/eurocolt/eurocolt1995.html#JainS95 -
9Academic Journal
Authors: W.A. Deuber, W. Thumser
Source: Combinatorics, Probability and Computing. 3:177-190
Subject Terms: Complexity of computation (including implicit computational complexity), 4. Education, well-quasi-ordering, Grzegorczyk-Wainer hierarchy, 0102 computer and information sciences, 0101 mathematics, 16. Peace & justice, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, regressive sequence
File Description: application/xml
Access URL: http://doi.org/10.1017/S0963548300001103
https://dblp.uni-trier.de/db/journals/cpc/cpc3.html#DeuberT94
https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/combinatorial-approach-to-complexity-theory-via-ordinal-hierarchies /AF2D7C8BDC04A2F7DBCF32D54C5728E1
https://doi.org/10.1017/S0963548300001103
http://cco.cup.cam.ac.uk/chapter.jsf?bid=CBO9780511662034&cid=CBO9780511662034A026 -
10Academic Journal
Authors: Bournez, Olivier, Hainry, Emmanuel
Contributors: Bournez, Olivier
Source: Theoretical Computer Science. 348:130-147
Subject Terms: computability, Computability, real recursive functions, 0102 computer and information sciences, [INFO] Computer Science [cs], 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Analog computations, analog computation, recursive analysis, Recursive analysis, 0101 mathematics, Grzegorczyk hierarchy, Real recursive functions, Analysis, Constructive and recursive analysis
File Description: application/xml
Linked Full TextAccess URL: https://hal.archives-ouvertes.fr/inria-00107812/
https://members.loria.fr/EHainry/papers/tcs05.pdf
https://hal.inria.fr/inria-00107812/document
https://www.sciencedirect.com/science/article/pii/S0304397505005293
https://www.loria.fr/%7Ehainry/papers/tcs05.pdf
https://hal.inria.fr/inria-00000518 -
11Academic Journal
Authors: Stanley S. Wainer, Richard S. Williams
Source: Annals of Pure and Applied Logic. 136:175-188
Subject Terms: First-order arithmetic and fragments, Logic, ordinal analysis, inductive definitions, predicative arithmetic, proof-theoretical investigation, 0102 computer and information sciences, Recursive ordinals and ordinal notations, provably recursive functions, 0101 mathematics, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies
File Description: application/xml
Linked Full TextAccess URL: https://zbmath.org/2207227
https://doi.org/10.1016/j.apal.2005.05.011
https://dblp.uni-trier.de/db/journals/apal/apal136.html#WainerW05
https://philpapers.org/rec/WAIIDO-3
https://www.sciencedirect.com/science/article/pii/S0168007205000588 -
12Academic Journal
Authors: E. A. Polyakov
Source: Mathematical Notes. 78:234-238
Subject Terms: Recursively (computably) enumerable sets and degrees, partial recursive function, \(\rho\)-resemblance type, \(R\)-universal function, 0101 mathematics, recursive permutation, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, recursive isomorphism
File Description: application/xml
-
13Academic Journal
Authors: Lorenzo Carlucci
Source: MLQ. 51:342-350
Subject Terms: Provability logics and related algebras (e.g., diagonalizable algebras), First-order arithmetic and fragments, 0102 computer and information sciences, Beklemishev's Worm Principle, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Kirby-Paris Hydra Game, well-quasi-order, independence results, provability logic, gap-embeddability, beklemishev's worm principle, gap-embedding, kirby-paris' hydra game, Games involving graphs, 0101 mathematics
File Description: application/xml
Access URL: https://dialnet.unirioja.es/servlet/articulo?codigo=2805513
http://onlinelibrary.wiley.com/doi/10.1002/malq.200410035/abstract
https://core.ac.uk/display/24718447
https://dblp.uni-trier.de/db/journals/mlq/mlq51.html#Carlucci05
https://hdl.handle.net/11573/138553
https://doi.org/10.1002/malq.200410035
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000230373000002&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396aLinked Full Text -
14Academic Journal
Authors: Karl-Heinz Niggl
Source: Annals of Pure and Applied Logic. 133:247-273
Subject Terms: Implicit computational complexity, Higher-type recursion, Logic, Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.), Theory of programming languages, 0102 computer and information sciences, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Imperative programming languages, Polynomial time, Complexity classes (hierarchies, relations among complexity classes, etc.), 0101 mathematics, Functional programming and lambda calculus, Grzegorczyk hierarchy, Lambda calculus
Linked Full TextFile Description: application/xml
-
15Academic Journal
Authors: Ostrin, G.E., Wainer, S.S.
Source: Annals of Pure and Applied Logic. 133:275-292
Subject Terms: First-order arithmetic and fragments, Complexity of computation (including implicit computational complexity), syntactically simple theories, Logic, Cut-elimination and normal-form theorems, 0102 computer and information sciences, provably recursive functions, 0101 mathematics, cut elimination, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, complexity classes
Linked Full TextFile Description: application/xml
-
16Academic Journal
Authors: Lars Kristiansen
Source: computational complexity. 14:72-88
Subject Terms: Logspace, Function algebras, Turing machines and related notions, Complexity classes (hierarchies, relations among complexity classes, etc.), Linspace, 0102 computer and information sciences, Models of computation (Turing machines, etc.), 0101 mathematics, Recursion schemes, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies
Linked Full TextFile Description: application/xml
-
17Academic Journal
Contributors: Bournez, Olivier
Source: Journal of Logic and Computation. 15:41-58
Subject Terms: function algebras, implicit complexity, Complexity of computation (including implicit computational complexity), complexity theory, 0102 computer and information sciences, Models of computation (Turing machines, etc.), 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Shub, Smale model, Complexity classes (hierarchies, relations among complexity classes, etc.), [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Blum, 0101 mathematics, Abstract and axiomatic computability and recursion theory, Blum-Shub-Smale model
File Description: application/xml
Access URL: https://inria.hal.science/inria-00102942v1
https://hal.inria.fr/inria-00102942
https://dblp.uni-trier.de/db/journals/logcom/logcom15.html#BournezCNM05
https://academic.oup.com/logcom/article/15/1/41/950725Linked Full Text -
18Academic Journal
Authors: Harry Buhrman, Albrecht Hoene, Leen Torenvliet
Source: Lecture Notes in Computer Science ISBN: 9783540565031
Subject Terms: Complexity of computation (including implicit computational complexity), completeness, mitoticity, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, reductions, 0101 mathematics, complexity, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies
File Description: application/xml
Access URL: https://ir.cwi.nl/pub/1286/1286D.pdf
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp27.html#BuhrmanHT98
https://www.narcis.nl/publication/RecordID/oai%3Acwi.nl%3A1286
https://epubs.siam.org/doi/abs/10.1137/S0097539795279724
https://core.ac.uk/display/23581291
https://dblp.uni-trier.de/db/conf/stacs/stacs93.html#BuhrmanHT93
https://rd.springer.com/chapter/10.1007/3-540-56503-5_20
https://link.springer.com/chapter/10.1007%2F3-540-56503-5_20 -
19Academic Journal
Authors: Jerzy Mycka, José Félix Costa
Source: Journal of Complexity. 20:835-857
Subject Terms: Statistics and Probability, Numerical Analysis, Algebra and Number Theory, Control and Optimization, General purpose analog computer, Recursive functions over the reals, Applied Mathematics, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, Models of computation (Turing machines, etc.), 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Higher-type and set recursion theory, Turing machines and related notions, Analog computation, 0101 mathematics
File Description: application/xml
Linked Full TextAccess URL: https://zbmath.org/2132589
https://doi.org/10.1016/j.jco.2004.06.001
https://dl.acm.org/doi/10.1016/j.jco.2004.06.001
https://core.ac.uk/display/82189849
https://www.mimuw.edu.pl/~salwicki/PPIM/Article.pdf
https://dblp.uni-trier.de/db/journals/jc/jc20.html#MyckaC04
https://www.sciencedirect.com/science/article/pii/S0885064X04000408
https://www.sciencedirect.com/science/article/abs/pii/S0885064X04000408 -
20Academic Journal
Authors: Satoru Kuroda
Source: computational complexity. 13:69-89
Subject Terms: function algebra, Complexity of computation (including implicit computational complexity), Switching theory, application of Boolean algebra, Boolean functions, bounded recursion schemata, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, circuit complexity, Recursive functions and relations, subrecursive hierarchies
File Description: application/xml
Linked Full TextAccess URL: https://zbmath.org/1788927
https://dblp.uni-trier.de/db/journals/cc/cc13.html#Kuroda04
https://link.springer.com/article/10.1007%2Fs00037-004-0184-4