Skip header Section
Skip Bibliometrics Section
Theory of recursive functions and effective computabilityJune 1987
- Author:
- Hartley Rogers
Abstract
No abstract available.
Cited By
- Mokatsian A (2024). Polynomial Time Turing Mitoticity and Arithmetical Hierarchy, Pattern Recognition and Image Analysis, 34:1, (9-19), Online publication date: 1-Mar-2024.
- Li C (2023). First-Order Theory of Probabilistic Independence and Single-Letter Characterizations of Capacity Regions, IEEE Transactions on Information Theory, 69:12, (7584-7601), Online publication date: 1-Dec-2023.
- Belanger D, Gao Z, Jain S, Li W and Stephan F (2023). Learnability and positive equivalence relations, Information and Computation, 295:PA, Online publication date: 1-Dec-2023.
- Gayral L and Sablik M (2023). Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings, Theory of Computing Systems, 67:6, (1209-1240), Online publication date: 1-Dec-2023.
- Arant T (2023). Recursive Polish spaces, Archive for Mathematical Logic, 62:7-8, (1101-1110), Online publication date: 1-Nov-2023.
- Szudzik M (2023). Semantics of Computable Physical Models, Studia Logica, 111:5, (779-819), Online publication date: 1-Oct-2023.
- Xie J and Hunt H (2023). On the undecidability and descriptional complexity of synchronized regular expressions, Acta Informatica, 60:3, (257-278), Online publication date: 1-Sep-2023.
Konovalov A (2022). A Generalized Realizability and Intuitionistic Logic, ACM Transactions on Computational Logic, 24:2, (1-15), Online publication date: 30-Apr-2023.- Selivanov V (2023). Descriptive complexity of qc b 0-spaces, Theoretical Computer Science, 945:C, Online publication date: 4-Feb-2023.
- Tiraboschi I, Rezk T and Rival X Sound Symbolic Execution via Abstract Interpretation and Its Application to Security Verification, Model Checking, and Abstract Interpretation, (267-295)
- Forster Y, Jahn F and Smolka G A Computational Cantor-Bernstein and Myhill’s Isomorphism Theorem in Constructive Type Theory (Proof Pearl) Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, (159-166)
- Gao X, Li J and Miao D (2022). Sublinear-time reductions for big data computing, Theoretical Computer Science, 932:C, (1-12), Online publication date: 6-Oct-2022.
- Barendregt H and Terwijn S (2022). Partial combinatory algebra and generalized numberings, Theoretical Computer Science, 925:C, (37-44), Online publication date: 10-Aug-2022.
- Belle V (2022). Analyzing generalized planning under nondeterminism, Artificial Intelligence, 307:C, Online publication date: 1-Jun-2022.
- Campion M, Dalla Preda M and Giacobazzi R (2022). Partial (In)Completeness in abstract interpretation: limiting the imprecision in program analysis, Proceedings of the ACM on Programming Languages, 6:POPL, (1-31), Online publication date: 16-Jan-2022.
- Fu Y (2022). A thesis for interaction, Theoretical Computer Science, 897:C, (114-134), Online publication date: 2-Jan-2022.
- Jain S, Stephan F and Zeugmann T (2022). On the amount of nonconstructivity in learning formal languages from text, Information and Computation, 281:C, Online publication date: 1-Dec-2021.
- Honkala J (2021). Quasi-universal k-regular sequences, Theoretical Computer Science, 891:C, (84-89), Online publication date: 4-Nov-2021.
- Ji Z, Natarajan A, Vidick T, Wright J and Yuen H (2021). MIP* = RE, Communications of the ACM, 64:11, (131-138), Online publication date: 1-Nov-2021.
- Konovalov A (2021). Generalized Realizability and Basic Logic, ACM Transactions on Computational Logic, 22:4, (1-23), Online publication date: 31-Oct-2021.
- Berger J, Böther M, Doskoč V, Harder J, Klodt N, Kötzing T, Lötzsch W, Peters J, Schiller L, Seifert L, Wells A and Wietheger S Learning Languages with Decidable Hypotheses Connecting with Computability, (25-37)
- Doskoč V and Kötzing T Normal Forms for Semantically Witness-Based Learners in Inductive Inference Connecting with Computability, (158-168)
- Doskoč V and Kötzing T Mapping Monotonic Restrictions in Inductive Inference Connecting with Computability, (146-157)
- Kuznetsov S (2021). Action Logic is Undecidable, ACM Transactions on Computational Logic, 22:2, (1-26), Online publication date: 30-Apr-2021.
- Iarullin R (2020). eT-Reducibility of Sets, Automatic Control and Computer Sciences, 54:7, (615-618), Online publication date: 1-Dec-2020.
- Zeugmann T On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings Beyond the Horizon of Computability, (124-136)
- Matos A, Paolini L and Roversi L (2020). The fixed point problem of a simple reversible language, Theoretical Computer Science, 813:C, (143-154), Online publication date: 12-Apr-2020.
- Calude C, Jain S, Merkle W and Stephan F (2020). Searching for shortest and least programs, Theoretical Computer Science, 807:C, (114-127), Online publication date: 6-Feb-2020.
- Bruni R, Giacobazzi R, Gori R, Garcia-Contreras I and Pavlovic D (2019). Abstract extensionality: on the properties of incomplete abstract interpretations, Proceedings of the ACM on Programming Languages, 4:POPL, (1-28), Online publication date: 1-Jan-2020.
- Jeandel E, Moutot E and Vanier P (2019). Slopes of Multidimensional Subshifts, Theory of Computing Systems, 64:1, (35-61), Online publication date: 1-Jan-2020.
- Nehéz M and Bartalos P Complexity Aspects of Unstructured Sparse Graph Representation Proceedings of the 9th Balkan Conference on Informatics, (1-3)
- Abrahão F, Wehmuth K and Ziviani A (2019). Algorithmic networks, Theoretical Computer Science, 785:C, (83-116), Online publication date: 20-Sep-2019.
- de Wynter A On the Bounds of Function Approximations Artificial Neural Networks and Machine Learning – ICANN 2019: Theoretical Neural Computation, (401-417)
- Feng X, Xu H, Wang Y and Yu H (2019). The social team building optimization algorithm, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 23:15, (6533-6554), Online publication date: 1-Aug-2019.
- Shafer P and Sorbi A (2019). Comparing the degrees of enumerability and the closed Medvedev degrees, Archive for Mathematical Logic, 58:5-6, (527-542), Online publication date: 1-Aug-2019.
- Klinkhamer A and Ebnenasir A (2019). On the Verification of Livelock-Freedom and Self-Stabilization on Parameterized Rings, ACM Transactions on Computational Logic, 20:3, (1-36), Online publication date: 31-Jul-2019.
- Holzer M and Kutrib M Non-Recursive Trade-Offs Are “Almost Everywhere” Computing with Foresight and Industry, (25-36)
- Jain S and Kinber E (2019). Intrinsic complexity of partial learning, Theoretical Computer Science, 776:C, (43-63), Online publication date: 12-Jul-2019.
- Guillon P, Jeandel E, Kari J and Vanier P Undecidable Word Problem in Subshift Automorphism Groups Computer Science – Theory and Applications, (180-190)
- Dudakov S and Karlov B On Decidability of Regular Languages Theories Computer Science – Theory and Applications, (119-130)
- Ackerman N, Freer C and Roy D (2019). On the Computability of Conditional Probability, Journal of the ACM, 66:3, (1-40), Online publication date: 30-Jun-2019.
- Bazhenov N, Mustafa M and Yamaleev M (2019). Elementary theories and hereditary undecidability for semilattices of numberings, Archive for Mathematical Logic, 58:3-4, (485-500), Online publication date: 9-May-2019.
- Goncharov S, Knight J and Souldatos I (2018). Hanf number for Scott sentences of computable structures, Archive for Mathematical Logic, 57:7-8, (889-907), Online publication date: 1-Nov-2018.
- Case A (2018). Bounded Turing Reductions and Data Processing Inequalities for Sequences, Theory of Computing Systems, 62:7, (1586-1598), Online publication date: 1-Oct-2018.
- Bacci G, Furber R, Kozen D, Mardare R, Panangaden P and Scott D Boolean-Valued Semantics for the Stochastic λ-Calculus Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, (669-678)
- Moutot E and Vanier P Slopes of 3-Dimensional Subshifts of Finite Type Computer Science – Theory and Applications, (257-268)
- Pavlovic D and Yahia M Monoidal Computer III: A Coalgebraic View of Computability and Complexity (Extended Abstract) Coalgebraic Methods in Computer Science, (167-189)
- Jha S and Seshia S (2017). A theory of formal synthesis via inductive learning, Acta Informatica, 54:7, (693-726), Online publication date: 1-Nov-2017.
- Vereshchagin N (2017). Short lists with short programs from programs of functions and strings, Theory of Computing Systems, 61:4, (1440-1450), Online publication date: 1-Nov-2017.
- Hoyrup M and Rojas C (2017). On the Information Carried by Programs About the Objects they Compute, Theory of Computing Systems, 61:4, (1214-1236), Online publication date: 1-Nov-2017.
- Furia C and Spoletini P (2017). Bounded variability of metric temporal logic, Annals of Mathematics and Artificial Intelligence, 80:3-4, (283-316), Online publication date: 1-Aug-2017.
- Khoussainov B and Takisaka T Large scale geometries of infinite strings Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)
- Hoenicke J, Majumdar R and Podelski A (2017). Thread modularity at many levels: a pearl in compositional verification, ACM SIGPLAN Notices, 52:1, (473-485), Online publication date: 11-May-2017.
- Hoenicke J, Majumdar R and Podelski A Thread modularity at many levels: a pearl in compositional verification Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, (473-485)
- Jain S, Kötzing T and Stephan F (2016). Enlarging learnable classes, Information and Computation, 251:C, (194-207), Online publication date: 1-Dec-2016.
- Anand B (2016). The truth assignments that differentiate human reasoning from mechanistic reasoning, Cognitive Systems Research, 40:C, (35-45), Online publication date: 1-Dec-2016.
- Jain S and Kinber E Intrinsic Complexity of Partial Learning Algorithmic Learning Theory, (174-188)
- Beros A, Gao Z and Zilles S Classifying the Arithmetical Complexity of Teaching Models Algorithmic Learning Theory, (145-160)
- Cao C, Sui Y and Zhang Z (2016). The M-computations induced by accessibility relations in nonstandard models M of Hoare logic, Frontiers of Computer Science: Selected Publications from Chinese Universities, 10:4, (717-725), Online publication date: 1-Aug-2016.
- Khoussainov B Quantifier Free Definability on Infinite Algebras Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (730-738)
- Frittaion E, Hendtlass M, Marcone A, Shafer P and Van der Meeren J (2016). Reverse mathematics, well-quasi-orders, and Noetherian spaces, Archive for Mathematical Logic, 55:3-4, (431-459), Online publication date: 1-May-2016.
- Thomas S and Williams J (2016). The bi-embeddability relation for finitely generated groups II, Archive for Mathematical Logic, 55:3-4, (385-396), Online publication date: 1-May-2016.
- Platzer A (2015). Differential Game Logic, ACM Transactions on Computational Logic, 17:1, (1-51), Online publication date: 10-Dec-2015.
- Jeandel E and Vanier P (2015). Hardness of conjugacy, embedding and factorization of multidimensional subshifts, Journal of Computer and System Sciences, 81:8, (1648-1664), Online publication date: 1-Dec-2015.
- Bosserhoff V and Hertling P (2015). Effective subsets under homeomorphisms of R n, Information and Computation, 245:C, (197-212), Online publication date: 1-Dec-2015.
- Omanadze R (2015). Some properties of r-maximal sets and Q1,-reducibility, Archive for Mathematical Logic, 54:7-8, (941-959), Online publication date: 1-Nov-2015.
- Gao Z, Stephan F and Zilles S Combining Models of Approximation with Partial Learning Proceedings of the 26th International Conference on Algorithmic Learning Theory - Volume 9355, (56-70)
- Jain S, Ma J and Stephan F Priced Learning Proceedings of the 26th International Conference on Algorithmic Learning Theory - Volume 9355, (41-55)
- Endrullis J, Grabmayer C and Hendriks D Regularity Preserving but Not Reflecting Encodings Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), (535-546)
- El-Zawawy M Novel Designs for Memory Checkers Using Semantics and Digital Sequential Circuits Proceedings, Part IV, of the 15th International Conference on Computational Science and Its Applications -- ICCSA 2015 - Volume 9158, (597-611)
- Finkel O (2015). The exact complexity of the infinite Post Correspondence Problem, Information Processing Letters, 115:6, (609-611), Online publication date: 1-Jun-2015.
- Giacobazzi R, Logozzo F and Ranzato F (2015). Analyzing Program Analyses, ACM SIGPLAN Notices, 50:1, (261-273), Online publication date: 11-May-2015.
- Dalla Preda M, Giacobazzi R, Lakhotia A and Mastroeni I (2015). Abstract Symbolic Automata, ACM SIGPLAN Notices, 50:1, (329-341), Online publication date: 11-May-2015.
- Brand M (2015). Arbitrary sequence RAMs, Information Processing Letters, 115:2, (193-198), Online publication date: 1-Feb-2015.
- Badaev S, Manat M and Sorbi A (2015). Friedberg numberings in the Ershov hierarchy, Archive for Mathematical Logic, 54:1-2, (59-73), Online publication date: 1-Feb-2015.
- Giacobazzi R, Logozzo F and Ranzato F Analyzing Program Analyses Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (261-273)
- Dalla Preda M, Giacobazzi R, Lakhotia A and Mastroeni I Abstract Symbolic Automata Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (329-341)
- Asperti A The Speedup Theorem in a Primitive Recursive Framework Proceedings of the 2015 Conference on Certified Programs and Proofs, (175-182)
- Choffrut C and Grigorieff S (2015). Logical Theory of the Monoid of Languages over a Non Tally Alphabet, Fundamenta Informaticae, 138:1-2, (159-177), Online publication date: 1-Jan-2015.
- Glaßer C, Hughes A, Selman A and Wisiol N (2014). Disjoint NP-Pairs and Propositional Proof Systems, ACM SIGACT News, 45:4, (59-75), Online publication date: 9-Dec-2014.
- Hariri B, Calvanese D, Montali M and Deutsch A State-boundedness in data-aware dynamic systems Proceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning, (458-467)
- Jura M, Levin O and Markkanen T (2014). Domatic partitions of computable graphs, Archive for Mathematical Logic, 53:1-2, (137-155), Online publication date: 1-Feb-2014.
- Klinkhamer A and Ebnenasir A Verifying Livelock Freedom on Parameterized Rings and Chains 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems - Volume 8255, (163-177)
- Ketema J and Simonsen J (2013). Least upper bounds on the size of confluence and church-rosser diagrams in term rewriting and λ-calculus, ACM Transactions on Computational Logic, 14:4, (1-28), Online publication date: 1-Nov-2013.
- Freydenberger D and Reidenbach D (2013). Inferring descriptive generalisations of formal languages, Journal of Computer and System Sciences, 79:5, (622-639), Online publication date: 1-Aug-2013.
- Speranski S (2013). A note on definability in fragments of arithmetic with free unary predicates, Archive for Mathematical Logic, 52:5-6, (507-516), Online publication date: 1-Aug-2013.
- Fu Y The value-passing calculus Theories of Programming and Formal Methods, (166-195)
- Gao Z and Stephan F Confident and consistent partial learning of recursive functions Proceedings of the 23rd international conference on Algorithmic Learning Theory, (51-65)
- Jain S, Kötzing T and Stephan F Enlarging learnable classes Proceedings of the 23rd international conference on Algorithmic Learning Theory, (36-50)
- Byrd W, Holk E and Friedman D miniKanren, live and untagged Proceedings of the 2012 Annual Workshop on Scheme and Functional Programming, (8-29)
- Omanadze R and Chitaia I (2012). Q1-degrees of c.e. sets, Archive for Mathematical Logic, 51:5-6, (503-515), Online publication date: 1-Aug-2012.
- Gao Z and Stephan F Learnability of co-r.e. classes Proceedings of the 6th international conference on Language and Automata Theory and Applications, (252-263)
- Marsibilio D and Sorbi A (2012). Bounded enumeration reducibility and its degree structure, Archive for Mathematical Logic, 51:1-2, (163-186), Online publication date: 1-Feb-2012.
- Balodis K, Kucevalovs I and Freivalds R Frequency prediction of functions Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science, (76-83)
- Jain S, Martin E and Stephan F Learning and classifying Proceedings of the 22nd international conference on Algorithmic learning theory, (70-83)
- Kötzing T Iterative learning from positive data and counters Proceedings of the 22nd international conference on Algorithmic learning theory, (40-54)
- Baeten J, Luttik B and van Tilburg P Reactive turing machines Proceedings of the 18th international conference on Fundamentals of computation theory, (348-359)
- Nessel J and Cimpa B The MovieOracle - Content Based Movie Recommendations Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03, (361-364)
- Case J and Moelius III S (2011). Properties Complementary to Program Self-Reference, Fundamenta Informaticae, 111:3, (281-311), Online publication date: 1-Aug-2011.
- Freivalds R and Zeugmann T On the amount of nonconstructivity in learning recursive functions Proceedings of the 8th annual conference on Theory and applications of models of computation, (332-343)
- Jain S, Stephan F and Teutsch J Closed left-R.E. sets Proceedings of the 8th annual conference on Theory and applications of models of computation, (218-229)
- Chitaia I, Omanadze R and Sorbi A (2011). Immunity properties and strong positive reducibilities, Archive for Mathematical Logic, 50:3-4, (341-352), Online publication date: 1-May-2011.
- Lewis A, Shore R and Sorbi A (2011). Topological aspects of the Medvedev lattice, Archive for Mathematical Logic, 50:3-4, (319-340), Online publication date: 1-May-2011.
- Jain S and Kinber E Inductive inference of languages from samplings Proceedings of the 21st international conference on Algorithmic learning theory, (330-344)
- Moelius S and Zilles S Learning without coding Proceedings of the 21st international conference on Algorithmic learning theory, (300-314)
- Case J and Kötzing T Solutions to open questions for non-u-shaped learning with memory limitations Proceedings of the 21st international conference on Algorithmic learning theory, (285-299)
- Pucella R and Schneider F (2010). Independence from obfuscation: A semantic framework for diversity, Journal of Computer Security, 18:5, (701-749), Online publication date: 1-Sep-2010.
- Lago U A short introduction to implicit computational complexity Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation, (89-109)
- Kjos-Hanssen B and Reimann J The strength of the Besicovitch-Davies theorem Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe, (229-238)
- Kasprzik A and Kötzing T String extension learning using lattices Proceedings of the 4th international conference on Language and Automata Theory and Applications, (380-391)
- Ketema J and Simonsen J Least upper bounds on the size of church-rosser diagrams in term rewriting and λ-calculus Proceedings of the 10th international conference on Functional and Logic Programming, (272-287)
- Svozil K (2010). The diagonalization method in quantum recursion theory, Quantum Information Processing, 9:2, (295-305), Online publication date: 1-Apr-2010.
- Furia C, Mandrioli D, Morzenti A and Rossi M (2010). Modeling time in computing, ACM Computing Surveys, 42:2, (1-59), Online publication date: 1-Feb-2010.
- Cintula P and Hájek P (2010). Triangular norm based predicate fuzzy logics, Fuzzy Sets and Systems, 161:3, (311-346), Online publication date: 1-Feb-2010.
- Galatolo S, Hoyrup M and Rojas C (2010). Effective symbolic dynamics, random points, statistical behavior, complexity and entropy, Information and Computation, 208:1, (23-41), Online publication date: 1-Jan-2010.
- Jain S, Stephan F and Ye N Learning from streams Proceedings of the 20th international conference on Algorithmic learning theory, (338-352)
- Carlucci L Incremental learning with ordinal bounded example memory Proceedings of the 20th international conference on Algorithmic learning theory, (323-337)
- Jain S and Kinber E Iterative learning from texts and counterexamples using additional information Proceedings of the 20th international conference on Algorithmic learning theory, (308-322)
- Case J and Kötzing T Difficulties in forcing fairness of polynomial time inductive inference Proceedings of the 20th international conference on Algorithmic learning theory, (263-277)
- Endrullis J, Geuvers H and Zantema H Degrees of undecidability in term rewriting Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic, (255-270)
- Hänsch P, Slaats M and Thomas W Parametrized regular infinite games and higher-order pushdown strategies Proceedings of the 17th international conference on Fundamentals of computation theory, (181-192)
- Case J and Moelius S Independence results for n-ary recursion theorems Proceedings of the 17th international conference on Fundamentals of computation theory, (38-49)
- Svozil K and Tkadlec J (2009). On the solution of trivalent decision problems by quantum state identification, Natural Computing: an international journal, 8:3, (539-546), Online publication date: 1-Sep-2009.
- Bauer A and Taylor P (2009). The dedekind reals in abstract stone duality, Mathematical Structures in Computer Science, 19:4, (757-838), Online publication date: 1-Aug-2009.
- Choffrut C and Grigorieff S (2009). The "equal last letter" predicate for words on infinite alphabets and classes of multitape automata, Theoretical Computer Science, 410:30-32, (2870-2884), Online publication date: 1-Aug-2009.
- Escardó M (2009). Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting, Electronic Notes in Theoretical Computer Science (ENTCS), 249, (219-242), Online publication date: 1-Aug-2009.
- Lewis A, Nies A and Sorbi A The First Order Theories of the Medvedev and Muchnik Lattices Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice, (324-331)
- Freer C and Roy D Computable Exchangeable Sequences Have Computable de Finetti Measures Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice, (218-231)
- Fokina E and Friedman S Equivalence Relations on Classes of Computable Structures Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice, (198-207)
- Case J and Moelius S Program Self-reference in Constructive Scott Subdomains Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice, (89-98)
- Jain S (2009). On some open problems in monotonic and conservative learning, Information Processing Letters, 109:16, (923-926), Online publication date: 1-Jul-2009.
- Hoyrup M and Rojas C (2009). Computability of probability measures and Martin-Löf randomness over metric spaces, Information and Computation, 207:7, (830-847), Online publication date: 1-Jul-2009.
- Jain S and Kinber E (2009). One-shot learners using negative counterexamples and nearest positive examples, Theoretical Computer Science, 410:27-29, (2562-2580), Online publication date: 1-Jun-2009.
- Sorbi A Strong Positive Reducibilities Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation, (29-38)
- Sangiorgi D (2009). On the origins of bisimulation and coinduction, ACM Transactions on Programming Languages and Systems, 31:4, (1-41), Online publication date: 1-May-2009.
- Finkel O (2009). Highly Undecidable Problems about Recognizability by Tiling Systems, Fundamenta Informaticae, 91:2, (305-323), Online publication date: 5-Apr-2009.
- Finkel O (2009). Highly Undecidable Problems about Recognizability by Tiling Systems, Fundamenta Informaticae, 91:2, (305-323), Online publication date: 1-Apr-2009.
- Jain S (2009). On some open problems in reflective inductive inference, Information Processing Letters, 109:3, (208-211), Online publication date: 1-Jan-2009.
- Selivanov V (2008). On the Difference Hierarchy in Countably Based T0-Spaces, Electronic Notes in Theoretical Computer Science (ENTCS), 221, (257-269), Online publication date: 1-Dec-2008.
- Korovina M and Kudinov O (2008). Towards Computability over Effectively Enumerable Topological Spaces, Electronic Notes in Theoretical Computer Science (ENTCS), 221, (115-125), Online publication date: 1-Dec-2008.
- Case J and Kötzing T Dynamic Modeling in Inductive Inference Algorithmic Learning Theory, (404-418)
- Case J and Kötzing T Dynamically Delayed Postdictive Completeness and Consistency in Learning Algorithmic Learning Theory, (389-403)
- Becerra-Bonache L, Case J, Jain S and Stephan F Iterative Learning of Simple External Contextual Languages Algorithmic Learning Theory, (359-373)
- Selivanov V (2008). Fine hierarchies and m-reducibilities in theoretical computer science, Theoretical Computer Science, 405:1-2, (116-163), Online publication date: 1-Oct-2008.
- Durand B, Romashchenko A and Shen A Fixed Point and Aperiodic Tilings Proceedings of the 12th international conference on Developments in Language Theory, (276-288)
- Iwamoto C, Yoneda H, Morita K and Imai K (2008). A Recursive Padding Technique on Nondeterministic Cellular Automata, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E91-A:9, (2335-2340), Online publication date: 1-Sep-2008.
- Jain S, Stephan F and Nan Y (2008). Prescribed Learning of Indexed Families, Fundamenta Informaticae, 83:1-2, (159-175), Online publication date: 15-Aug-2008.
- Glaßer C, Reitwießner C and Selivanov V The Shrinking Property for NP and coNP Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms, (210-220)
- V'yugin V On sequences with non-learnable subsequences Proceedings of the 3rd international conference on Computer science: theory and applications, (302-313)
- Hoyrup M, Kolçak A and Longo G (2008). Computability and the morphological complexity of some dynamics on continuous domains, Theoretical Computer Science, 398:1-3, (170-182), Online publication date: 20-May-2008.
- Jain S and Kinber E (2008). Learning and extending sublanguages, Theoretical Computer Science, 397:1-3, (233-246), Online publication date: 10-May-2008.
- Reidenbach D (2008). Discontinuities in pattern inference, Theoretical Computer Science, 397:1-3, (166-193), Online publication date: 10-May-2008.
- Jain S, Martin E and Stephan F (2008). Absolute versus probabilistic classification in a logical setting, Theoretical Computer Science, 397:1-3, (114-128), Online publication date: 10-May-2008.
- Freivalds R and Bonner R (2008). Quantum inductive inference by finite automata, Theoretical Computer Science, 397:1-3, (70-76), Online publication date: 10-May-2008.
- Grieser G (2008). Reflective inductive inference of recursive functions, Theoretical Computer Science, 397:1-3, (57-69), Online publication date: 10-May-2008.
- Zeugmann T and Zilles S (2008). Learning recursive functions, Theoretical Computer Science, 397:1-3, (4-56), Online publication date: 10-May-2008.
- Marek V and Remmel J (2007). Compactness Properties for Stable Semantics of Logic Programs, Fundamenta Informaticae, 81:1-3, (211-239), Online publication date: 1-May-2008.
- Monniaux D (2008). The pitfalls of verifying floating-point computations, ACM Transactions on Programming Languages and Systems, 30:3, (1-41), Online publication date: 1-May-2008.
- Brodhead P and Cenzer D (2008). Effectively closed sets and enumerations, Archive for Mathematical Logic, 46:7-8, (565-582), Online publication date: 1-May-2008.
- Rojas C (2008). Computability and information in models of randomness and chaos†, Mathematical Structures in Computer Science, 18:2, (291-307), Online publication date: 1-Apr-2008.
- Asperti A (2008). The intensional content of Rice's theorem, ACM SIGPLAN Notices, 43:1, (113-119), Online publication date: 14-Jan-2008.
- Asperti A The intensional content of Rice's theorem Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (113-119)
- Jain S, Stephan F and Nan Y (2008). Prescribed Learning of Indexed Families, Fundamenta Informaticae, 83:1-2, (159-175), Online publication date: 1-Jan-2008.
- Jain S and Kinber E (2007). Learning languages from positive data and a limited number of short counterexamples, Theoretical Computer Science, 389:1-2, (190-218), Online publication date: 10-Dec-2007.
- Carlucci L, Case J, Jain S and Stephan F (2007). Results on memory-limited U-shaped learning, Information and Computation, 205:10, (1551-1573), Online publication date: 1-Oct-2007.
- Korovin K and Voronkov A Integrating linear arithmetic into superposition calculus Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic, (223-237)
- Burgin M Universality, reducibility, and completeness Proceedings of the 5th international conference on Machines, computations, and universality, (24-38)
- Staiger L (2007). The Kolmogorov complexity of infinite words, Theoretical Computer Science, 383:2-3, (187-199), Online publication date: 3-Sep-2007.
- Burgin M (2007). Algorithmic complexity as a criterion of unsolvability, Theoretical Computer Science, 383:2-3, (244-259), Online publication date: 3-Sep-2007.
- Intrigila B and Statman R The omega rule is Π11-complete in the λβ-calculus Proceedings of the 8th international conference on Typed lambda calculi and applications, (178-193)
- Hamkins J, Linetsky D and Miller R The Complexity of Quickly ORM-Decidable Sets Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World, (488-496)
- Ziegler M (Short) Survey of Real Hypercomputation Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World, (809-824)
- Trautteur G Does the Cell Compute? Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World, (742-747)
- Case J and Moeliusiii S Characterizing Programming Systems Allowing Program Self-reference Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World, (125-134)
- Case J Resource Restricted Computability Theoretic Learning Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World, (115-124)
- Case J and Moelius S Cautious virus detection in the extreme Proceedings of the 2007 workshop on Programming languages and analysis for security, (47-52)
- Kurtz S and Simon J The undecidability of the generalized Collatz problem Proceedings of the 4th international conference on Theory and applications of models of computation, (542-553)
- Iwamoto C, Yoneda H, Morita K and Imai K A time hierarchy theorem for nondeterministic cellular automata Proceedings of the 4th international conference on Theory and applications of models of computation, (511-520)
- Hitchcock J, Lutz J and Terwijn S (2007). The arithmetical complexity of dimension and randomness, ACM Transactions on Computational Logic, 8:2, (13-es), Online publication date: 1-Apr-2007.
- Marek V and Remmel J (2007). Compactness Properties for Stable Semantics of Logic Programs, Fundamenta Informaticae, 81:1-3, (211-239), Online publication date: 1-Jan-2007.
- Demri S, Lazić R and Nowak D (2007). On the freeze quantifier in Constraint LTL, Information and Computation, 205:1, (2-24), Online publication date: 1-Jan-2007.
- Zeugmann T (2006). From learning in the limit to stochastic finite learning, Theoretical Computer Science, 364:1, (77-97), Online publication date: 2-Nov-2006.
- Zilles S (2006). An approach to intrinsic complexity of uniform learning, Theoretical Computer Science, 364:1, (42-61), Online publication date: 2-Nov-2006.
- Jain S and Kinber E Iterative learning from positive data and negative counterexamples Proceedings of the 17th international conference on Algorithmic Learning Theory, (154-168)
- Jain S and Kinber E Learning and extending sublanguages Proceedings of the 17th international conference on Algorithmic Learning Theory, (139-153)
- Fenner S and Gasarch W The complexity of learning SUBSEQ (A) Proceedings of the 17th international conference on Algorithmic Learning Theory, (109-123)
- Roşu G Equality of streams is a Π0 over 2-complete problem Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming, (184-191)
- Roşu G (2006). Equality of streams is a Π0 over 2-complete problem, ACM SIGPLAN Notices, 41:9, (184-191), Online publication date: 16-Sep-2006.
- De Jaeger F, Escardó M and Santini G (2006). On the computational content of the Lawson topology, Theoretical Computer Science, 357:1, (230-240), Online publication date: 25-Jul-2006.
- Hamlet D Subdomain testing of units and systems with state Proceedings of the 2006 international symposium on Software testing and analysis, (85-96)
- Akama Y and Zeugmann T Consistency conditions for inductive inference of recursive functions Proceedings of the 20th annual conference on New frontiers in artificial intelligence, (251-264)
- Zeugmann T Inductive inference and language learning Proceedings of the Third international conference on Theory and Applications of Models of Computation, (464-473)
- Jain S and Stephan F Some recent results in u-shaped learning Proceedings of the Third international conference on Theory and Applications of Models of Computation, (421-431)
- Bauer A (2006). First Steps in Synthetic Computability Theory, Electronic Notes in Theoretical Computer Science (ENTCS), 155, (5-31), Online publication date: 1-May-2006.
- Woodward J Invariance of function complexity under primitive recursive functions Proceedings of the 9th European conference on Genetic Programming, (310-319)
- Jain S and Kinber E (2006). Learning languages from positive data and a finite number of queries, Information and Computation, 204:1, (123-175), Online publication date: 1-Jan-2006.
- Nessel J and Lange S (2005). Learning erasing pattern languages with queries, Theoretical Computer Science, 348:1, (41-57), Online publication date: 2-Dec-2005.
- Hemaspaandra E, Hemaspaandra L and Hempel H (2005). All superlinear inverse schemes are coNP-hard, Theoretical Computer Science, 345:2-3, (345-358), Online publication date: 22-Nov-2005.
- Carlucci L, Jain S, Kinber E and Stephan F Variations on u-shaped learning Proceedings of the 18th annual conference on Learning Theory, (382-397)
- Kalimullin I On the problems of definability in the enumeration degrees Proceedings of the First international conference on Computability in Europe: new Computational Paradigms, (221-222)
- Goldin D and Wegner P The church-turing thesis Proceedings of the First international conference on Computability in Europe: new Computational Paradigms, (152-168)
- Vyugin M and V'yugin V (2005). Predictive complexity and information, Journal of Computer and System Sciences, 70:4, (539-554), Online publication date: 1-Jun-2005.
- Zilles S (2005). Increasing the power of uniform inductive learners, Journal of Computer and System Sciences, 70:4, (510-538), Online publication date: 1-Jun-2005.
- Hemmerling A (2005). Hierarchies of Function Classes Defined by the First-Value Operator, Electronic Notes in Theoretical Computer Science (ENTCS), 120:C, (59-72), Online publication date: 3-Feb-2005.
- Jain S and Kinber E Learning languages from positive data and a finite number of queries Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science, (360-371)
- Escardó M, Hofmann M and Streicher T (2004). On the non-sequential nature of the interval-domain model of real-number computation, Mathematical Structures in Computer Science, 14:6, (803-814), Online publication date: 1-Dec-2004.
- Escardó M (2004). Synthetic Topology, Electronic Notes in Theoretical Computer Science (ENTCS), 87, (21-156), Online publication date: 1-Nov-2004.
- Lowther J and Shene C (2004). Toward an intutive and interesting theory course, Journal of Computing Sciences in Colleges, 20:1, (124-135), Online publication date: 1-Oct-2004.
- Case J, Jain S, Stephan F and Wiehagen R (2004). Robust learning, Journal of Computer and System Sciences, 69:2, (123-165), Online publication date: 1-Sep-2004.
- Case J, Kinber E, Sharma A and Stephan F (2004). On the classification of recursive languages, Information and Computation, 192:1, (15-40), Online publication date: 1-Jul-2004.
- Royer J (2004). On the computational complexity of Longeley's H functional, Theoretical Computer Science, 318:1-2, (225-241), Online publication date: 6-Jun-2004.
- McColm G (2004). Guarded Quantification in Least Fixed Point Logic, Journal of Logic, Language and Information, 13:1, (61-110), Online publication date: 1-Jan-2004.
- Manolios P and Moore J (2003). Partial Functions in ACL2, Journal of Automated Reasoning, 31:2, (107-127), Online publication date: 16-Dec-2003.
- Jain S and Kinber E (2003). Intrinsic complexity of learning geometrical concepts from positive data, Journal of Computer and System Sciences, 67:3, (546-607), Online publication date: 1-Nov-2003.
- Ly O (2003). Automatic graphs and D0L-sequences of finite graphs, Journal of Computer and System Sciences, 67:3, (497-545), Online publication date: 1-Nov-2003.
- Fischer M and Merritt M (2003). Appraising two decades of distributed computing theory research, Distributed Computing, 16:2-3, (239-247), Online publication date: 1-Sep-2003.
- Jain S, Kinber E, Papazian C, Smith C and Wiehagen R (2003). On the intrinsic complexity of learning recursive functions, Information and Computation, 184:1, (45-70), Online publication date: 10-Jul-2003.
- Vollmer H Complexity theory made easy Proceedings of the 7th international conference on Developments in language theory, (95-110)
- Kupferman O and Vardi M π2 ∩ Σ2 ≡ AFMC Proceedings of the 30th international conference on Automata, languages and programming, (697-713)
- Blieberger J and Burgstaller B Eliminating redundant range checks in GNAT using symbolic evaluation Proceedings of the 8th Ada-Europe international conference on Reliable software technologies, (153-167)
- Hemaspaandra L and Hempel H (2003). P-immune sets with holes lack self-reducibility properties, Theoretical Computer Science, 302:1-3, (457-466), Online publication date: 13-Jun-2003.
- Piccinini G (2003). Alan Turing and the Mathematical Objection, Minds and Machines, 13:1, (23-48), Online publication date: 1-Feb-2003.
- Finkel O (2003). Borel hierarchy and omega context free languages, Theoretical Computer Science, 290:3, (1385-1405), Online publication date: 3-Jan-2003.
- Jain S (2003). The Intrinsic Complexity of Learning: A Survey, Fundamenta Informaticae, 57:1, (17-37), Online publication date: 1-Jan-2003.
- Jain S (2003). The Intrinsic Complexity of Learning: A Survey, Fundamenta Informaticae, 57:1, (17-37), Online publication date: 1-Jan-2003.
- Herman G Algorithms, theory of Encyclopedia of Computer Science, (51-53)
- Stephan F and Zeugmann T (2002). Learning classes of approximations to non-recursive functions, Theoretical Computer Science, 288:2, (309-341), Online publication date: 16-Oct-2002.
- Vyugin M and V'yugin V (2002). On complexity of easy predictable sequences, Information and Computation, 178:1, (241-252), Online publication date: 10-Oct-2002.
- Altenbernd J, Thomas W and Wöhrle S Tiling systems over infinite pictures and their acceptance conditions Proceedings of the 6th international conference on Developments in language theory, (297-306)
- Wells B (2002). Is There a Nonrecursive Decidable Equational Theory?, Minds and Machines, 12:2, (301-324), Online publication date: 1-May-2002.
- Israel D (2002). Reflections on Gödel's and Gandy's Reflections on Turing's Thesis, Minds and Machines, 12:2, (181-201), Online publication date: 1-May-2002.
- Blieberger J (2002). Data-Flow Frameworks for Worst-Case Execution Time Analysis, Real-Time Systems, 22:3, (183-227), Online publication date: 1-May-2002.
- Case J, Jain S and Suraj M (2002). Control structures in hypothesis spaces, Theoretical Computer Science, 270:1-2, (287-308), Online publication date: 6-Jan-2002.
- (2001). Language Learning from Texts, Journal of Computer and System Sciences, 63:3, (305-354), Online publication date: 1-Nov-2001.
- Apsītis K, Freivalds R, Simanovskis R and Smotrovs J (2001). Closedness properties in ex-identification, Theoretical Computer Science, 268:2, (367-393), Online publication date: 17-Oct-2001.
- Case J, Jain S, Kaufmann S, Sharma A and Stephan F (2001). Predictive learning models for concept drift, Theoretical Computer Science, 268:2, (323-349), Online publication date: 17-Oct-2001.
- David R (2001). On the asymptotic behaviour of primitive recursive algorithms, Theoretical Computer Science, 266:1-2, (159-193), Online publication date: 6-Sep-2001.
- Jain S, Lange S and Nessel J (2001). On the learnability of recursively enumerable languages from good examples, Theoretical Computer Science, 261:1, (3-29), Online publication date: 20-Jun-2001.
- Monniaux D (2001). An abstract Monte-Carlo method for the analysis of probabilistic programs, ACM SIGPLAN Notices, 36:3, (93-101), Online publication date: 1-Mar-2001.
- Nikitchenko N (2001). Applicative Compositions of Partial Predicates, Cybernetics and Systems Analysis, 37:2, (161-174), Online publication date: 1-Mar-2001.
- Lisovik L (2001). Macrotransducers and Applicative Systems for Partially Continuous Functions, Cybernetics and Systems Analysis, 37:2, (151-160), Online publication date: 1-Mar-2001.
- Statman R (2001). Marginalia to a Theorem of Jacopini, Fundamenta Informaticae, 45:1-2, (117-121), Online publication date: 1-Jan-2001.
- Statman R (2001). Marginalia to a Theorem of Jacopini, Fundamenta Informaticae, 45:1-2, (117-121), Online publication date: 1-Jan-2001.
- Monniaux D An abstract Monte-Carlo method for the analysis of probabilistic programs Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (93-101)
- Montagna F (2000). An Algebraic Approach to Propositional Fuzzy Logic, Journal of Logic, Language and Information, 9:1, (91-124), Online publication date: 1-Jan-2000.
- Reus B (1999). Formalizing Synthetic Domain Theory, Journal of Automated Reasoning, 23:3, (411-444), Online publication date: 1-Nov-1999.
- Kinber E, Papazian C, Smith C and Wiehagen R On the intrinsic complexity of learning recursive functions Proceedings of the twelfth annual conference on Computational learning theory, (257-266)
- Jain S and Sharma A On a generalized notion of mistake bounds Proceedings of the twelfth annual conference on Computational learning theory, (249-256)
- Edalat A and Lieutier A Foundation of a computable solid modeling Proceedings of the fifth ACM symposium on Solid modeling and applications, (278-284)
- Case J, Chen K and Jain S Costs of general purpose learning Proceedings of the 16th annual conference on Theoretical aspects of computer science, (424-433)
- Jain S, Smith C and Wiehagen R On the power of learning robustly Proceedings of the eleventh annual conference on Computational learning theory, (187-197)
- Nessel J Birds can fly… Proceedings of the eleventh annual conference on Computational learning theory, (56-63)
- Case J, Jain S, Ott M, Sharma A and Stephan F Robust learning aided by context Proceedings of the eleventh annual conference on Computational learning theory, (44-55)
- Kaufmann S and Stephan F Resource bounded next value and explanatory identification Proceedings of the tenth annual conference on Computational learning theory, (263-274)
- Gasarch W and Velauthapillai M (1997). Asking Questions versus Verifiability, Fundamenta Informaticae, 30:1, (1-9), Online publication date: 1-Jan-1997.
- Levin L (1996). Fundamentals of computing (a cheatlist), ACM SIGACT News, 27:3, (89), Online publication date: 1-Sep-1996.
- Soule T, Foster J and Dickinson J Code growth in genetic programming Proceedings of the 1st annual conference on genetic programming, (215-223)
- Marek V, Nerode A and Remmel J On the Complexity of Abduction Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
- Papadimitriou C, Suciu D and Vianu V Topological queries in spatial databases Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (81-92)
- Montagna F, Simi G and Sorbi A (1996). Logic and probabilistic systems, Archive for Mathematical Logic, 35:4, (225-261), Online publication date: 1-Jun-1996.
- Blair H (1996). Designing Dependencies, Fundamenta Informaticae, 28:1,2, (37-54), Online publication date: 1-Apr-1996.
- de Jongh D and Kanazawa M Angluin's theorem for indexed families of r.e. sets and applications Proceedings of the ninth annual conference on Computational learning theory, (193-204)
- Jain S and Sharma A Elementary formal systems, intrinsic complexity, and procrastination Proceedings of the ninth annual conference on Computational learning theory, (181-192)
- Baliga G, Case J and Jain S Synthesizing enumeration techniques for language learning Proceedings of the ninth annual conference on Computational learning theory, (169-180)
- Ambainis A Probabilistic and team PFIN-type learning Proceedings of the ninth annual conference on Computational learning theory, (157-168)
- Daley R, Kalyansundaram B and Velauthapillai M (1995). Breaking the Probability 12 Barrier in FIN-Type Learning, Journal of Computer and System Sciences, 50:3, (574-599), Online publication date: 1-Jun-1995.
- Cholak P and Blair H (1994). The Complexity Of Local Stratification, Fundamenta Informaticae, 21:4, (333-344), Online publication date: 1-Dec-1994.
- Jain S and Sharma A On the intrinsic complexity of language identification Proceedings of the seventh annual conference on Computational learning theory, (278-286)
- Freivalds R, Karpinski M and Smith C Co-learning of total recursive functions Proceedings of the seventh annual conference on Computational learning theory, (190-197)
- Thurber J (1994). Recursive and r.e. quotient Boolean algebras, Archive for Mathematical Logic, 33:2, (121-129), Online publication date: 1-Mar-1994.
- Jain S and Sharma A Probability is more powerful than team for language identification from positive data Proceedings of the sixth annual conference on Computational learning theory, (192-198)
- Kinber E, Smith C, Velauthapillai M and Wiehagen R On learning multiple concepts in parallel Proceedings of the sixth annual conference on Computational learning theory, (175-181)
- Freivalds R, Kinber E and Smith C On the impact of forgetting on learning machines Proceedings of the sixth annual conference on Computational learning theory, (165-174)
- Jones N Constant time factors do matter Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing, (602-611)
- Escardó M (1993). On lazy natural numbers with applications to computability theory and functional programming, ACM SIGACT News, 24:1, (61-67), Online publication date: 15-Jan-1993.
- Klarlund N Progress measures and stack assertions for fair termination Proceedings of the eleventh annual ACM symposium on Principles of distributed computing, (229-240)
- Freivalds R and Smith C On the role of procrastination for machine learning Proceedings of the fifth annual workshop on Computational learning theory, (363-376)
- Wiehagen R and Smith C Generalization versus classification Proceedings of the fifth annual workshop on Computational learning theory, (224-230)
- Case J, Jain S and Sharma A On learning limiting programs Proceedings of the fifth annual workshop on Computational learning theory, (193-202)
- Grove A, Halpern J and Koller D Asymptomatic conditional probabilities for first-order logic Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing, (294-305)
- Iyengar S and Bastani F (1992). Guest Editors' Introduction-Self-Organizing Knowledge and Data Representation in Distributed Environment, IEEE Transactions on Knowledge and Data Engineering, 4:2, (105-108), Online publication date: 1-Apr-1992.
- Podgurski A Reliability, sampling, and algorithmic randomness Proceedings of the symposium on Testing, analysis, and verification, (11-20)
- Alur R, Feder T and Henzinger T The benefits of relaxing punctuality Proceedings of the tenth annual ACM symposium on Principles of distributed computing, (139-152)
- Levin L (1991). Theory of computation, ACM SIGACT News, 22:1, (47-56), Online publication date: 1-Mar-1991.
- Harel D Hamiltonian paths in infinite graphs Proceedings of the twenty-third annual ACM symposium on Theory of Computing, (220-229)
- Lee V and Boehm H (1990). Optimizing programs over the constructive reals, ACM SIGPLAN Notices, 25:6, (102-111), Online publication date: 1-Jun-1990.
- Lee V and Boehm H Optimizing programs over the constructive reals Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation, (102-111)
- Jain S and Sharma A Hypothesis formation and language acquisition with an infinitely-often correct teacher Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge, (225-239)
- Adleman L An abstract theory of computer viruses (invited talk) Proceedings on Advances in cryptology, (354-374)
- Moschovakis Y Computable process Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (72-80)
- Gerla G (2023). TuringL-machines and recursive computability forL-maps, Studia Logica, 48:2, (179-192), Online publication date: 1-Jun-1989.
- Kurtz S, Mahaney S and Royer J The ismorphism conjecture fails relative to a random oracle Proceedings of the twenty-first annual ACM symposium on Theory of computing, (157-166)
- Boehm H (1987). Constructive real interpretation of numerical programs, ACM SIGPLAN Notices, 22:7, (214-221), Online publication date: 1-Jul-1987.
- Boehm H Constructive real interpretation of numerical programs Papers of the Symposium on Interpreters and interpretive techniques, (214-221)
- Apt K and Plotkin G (1986). Countable nondeterminism and random assignment, Journal of the ACM, 33:4, (724-767), Online publication date: 10-Aug-1986.
- Boehm H, Cartwright R, Riggle M and O'Donnell M Exact real arithmetic: a case study in higher order programming Proceedings of the 1986 ACM conference on LISP and functional programming, (162-173)
- Kornai A Natural languages and the Chomsky hierarchy Proceedings of the second conference on European chapter of the Association for Computational Linguistics, (1-7)
- Halpern J, Williams J, Wimmers E and Winkler T Denotational semantics and rewrite rules for FP Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (108-120)
- Harel D A general result on infinite trees and its applications Proceedings of the sixteenth annual ACM symposium on Theory of computing, (418-427)
- Mac an Airchinnigh M (1984). Some notes on the representation of the user's conceptual model, ACM SIGCHI Bulletin, 16:2, (62-69), Online publication date: 1-Oct-1984.
- Young P Some structural properties of polynomial reducibilities and sets in NP Proceedings of the fifteenth annual ACM symposium on Theory of computing, (392-401)
- O'Donnell M (1983). Technical communications, Communications of the ACM, 26:5, (386), Online publication date: 1-May-1983.
- Gurevich Y and Millard M (1983). Technical communications, Communications of the ACM, 26:5, (385-386), Online publication date: 1-May-1983.
- Gurevich Y and Millard M (1983). Technical communications, Communications of the ACM, 26:5, (385-386), Online publication date: 1-May-1983.
- McCall E (1983). Technical communications, Communications of the ACM, 26:5, (384-385), Online publication date: 1-May-1983.
- Fourer R (1983). Technical correspondence, Communications of the ACM, 26:5, (382-384), Online publication date: 1-May-1983.
- Calude C (1983). On a class of independent problems related to Rice theorem, ACM SIGACT News, 15:2, (53-57), Online publication date: 1-Apr-1983.
- Rosser J Highlights of the history of the lambda-calculus Proceedings of the 1982 ACM symposium on LISP and functional programming, (216-225)
- Feldman Y and Harel D A probabilistic dynamic logic Proceedings of the fourteenth annual ACM symposium on Theory of computing, (181-195)
- Harel D (1980). On folk theorems, Communications of the ACM, 23:7, (379-389), Online publication date: 1-Jul-1980.
- Ibarra O and Leininger B The complexity of the equivalence problem for straight-line programs Proceedings of the twelfth annual ACM symposium on Theory of computing, (273-280)
- Joseph D and Young P Independence results in Computer Science? (Preliminary Version) Proceedings of the twelfth annual ACM symposium on Theory of computing, (58-69)
- Plaisted D On the distribution of independent formulae of number theory Proceedings of the twelfth annual ACM symposium on Theory of computing, (39-44)
- Cohen N (1980). Gödel numbers, ACM SIGPLAN Notices, 15:4, (70-74), Online publication date: 1-Apr-1980.
- Kapur D and Mandayam S Expressiveness of the operation set of a data abstraction Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (139-153)
- Breidbart S (1979). APL and the Grzegorczyk hierarchy, ACM SIGAPL APL Quote Quad, 9:4-P1, (271-273), Online publication date: 1-Jun-1979.
- More T (1979). The nested rectangular array as a model of data, ACM SIGAPL APL Quote Quad, 9:4-P1, (55-73), Online publication date: 1-Jun-1979.
- Breidbart S APL and the Grzegorczyk hierarchy Proceedings of the international conference on APL: part 1, (271-273)
- More T The nested rectangular array as a model of data Proceedings of the international conference on APL: part 1, (55-73)
- Pour-El M Computer Science And Recursion Theory Proceedings of the 1978 annual conference, (15-20)
- Linden T (1978). On formal specifications and completeness, ACM SIGSOFT Software Engineering Notes, 3:3, (15-17), Online publication date: 1-Jul-1978.
- Case J and Smith C Anomaly hierarchies of mechanized inductive inference Proceedings of the tenth annual ACM symposium on Theory of computing, (314-319)
- Kozen D Indexing of subrecursive classes Proceedings of the tenth annual ACM symposium on Theory of computing, (287-295)
- Sciore E and Tang A Computability theory in admissible domains Proceedings of the tenth annual ACM symposium on Theory of computing, (95-104)
- LaPaugh A and Rivest R The subgraph homeomorphism problem Proceedings of the tenth annual ACM symposium on Theory of computing, (40-50)
- Harel D, Meyer A and Pratt V Computability and completeness in logics of programs (Preliminary Report) Proceedings of the ninth annual ACM symposium on Theory of computing, (261-268)
- Leong B and Seiferas J New real-time simulations of multihead tape units Proceedings of the ninth annual ACM symposium on Theory of computing, (239-248)
- Hartmanis J and Hopcroft J (1976). Independence results in computer science, ACM SIGACT News, 8:4, (13-24), Online publication date: 1-Oct-1976.
- Pyster A (1976). A language construct for "Dovetailing", ACM SIGACT News, 8:1, (38-40), Online publication date: 1-Jan-1976.
- Manna Z and Shamir A The optimal fixedpoint of recursive programs Proceedings of the seventh annual ACM symposium on Theory of computing, (194-206)
- Egli H and Constable R Computability concepts for programming language semantics Proceedings of the seventh annual ACM symposium on Theory of computing, (98-106)
- Kugel P (1975). A theorem about automatic programming, ACM SIGART Bulletin:51, (5-8), Online publication date: 1-Apr-1975.
- Ladner R, Lynch N and Selman A Comparison of polynomial-time reducibilities Proceedings of the sixth annual ACM symposium on Theory of computing, (110-121)
- Mehlhorn K Polynomial and abstract subrecursive classes Proceedings of the sixth annual ACM symposium on Theory of computing, (96-109)
- Hunt H and Rosenkrantz D Computational parallels between the regular and context-free languages Proceedings of the sixth annual ACM symposium on Theory of computing, (64-74)
- Lynch N, Meyer A and Fischer M Sets that don't help Proceedings of the fifth annual ACM symposium on Theory of computing, (130-134)
- Constable R Type two computational complexity Proceedings of the fifth annual ACM symposium on Theory of computing, (108-121)
- Roth R and LaFrance J (1973). Computer science for liberal arts colleges a report of a workshop held at Wheaton College, Wheaton, Illinois july 12-14, 1972, ACM SIGCSE Bulletin, 5:1, (70-76), Online publication date: 1-Feb-1973.
- Roth R and LaFrance J Computer science for liberal arts colleges a report of a workshop held at Wheaton College, Wheaton, Illinois july 12-14, 1972 Proceedings of the third SIGCSE technical symposium on Computer science education, (70-76)
- Fischer P Theory of computing in computer science education Proceedings of the May 16-18, 1972, spring joint computer conference, (857-864)
- Kang A On the complexity of proving functions Proceedings of the May 16-18, 1972, spring joint computer conference, (493-501)
- Meyer A and Bagchi A Program size and economy of descriptions Proceedings of the fourth annual ACM symposium on Theory of computing, (183-186)
- Constable R and Muchnick S Subrecursive program schemata I & II(I. Undecidable equivalence problems, II. Decidable equivalence problems) Proceedings of the fourth annual ACM symposium on Theory of computing, (1-17)
- Paterson M Decision problems in computational models Proceedings of ACM conference on Proving assertions about programs, (74-82)
- Paterson M (1972). Decision problems in computational models, ACM SIGACT News:14, (74-82), Online publication date: 1-Jan-1972.
- Paterson M (1972). Decision problems in computational models, ACM SIGPLAN Notices, 7:1, (74-82), Online publication date: 1-Jan-1972.
- Constable R (1972). The Operator Gap, Journal of the ACM, 19:1, (175-183), Online publication date: 1-Jan-1972.
- Borodin A (1972). Computational Complexity and the Existence of Complexity Gaps, Journal of the ACM, 19:1, (158-174), Online publication date: 1-Jan-1972.
- Robertson E Complexity classes of partial recursive functions (Preliminary Version) Proceedings of the third annual ACM symposium on Theory of computing, (258-266)
- Constable R Loop schemata Proceedings of the third annual ACM symposium on Theory of computing, (24-39)
- Ullian J Three theorems on abstract families of languages Proceedings of the second annual ACM symposium on Theory of computing, (226-230)
- Rosen B Tree-manipulating systems and Church-Rosser Theorems Proceedings of the second annual ACM symposium on Theory of computing, (117-127)
- Lewis F Unsolvability considerations in computational complexity Proceedings of the second annual ACM symposium on Theory of computing, (22-30)
- Cudia D The degree hierarchy of undecidable problems of formal grammars Proceedings of the second annual ACM symposium on Theory of computing, (10-21)
- Constable R On the size of programs in subrecursive formalisms Proceedings of the second annual ACM symposium on Theory of computing, (1-9)
- Blum E Towards a theory of semantics and compilers for programming languages Proceedings of the first annual ACM symposium on Theory of computing, (217-227)
- Young P Speed-ups by changing the order in which sets are enumerated (Preliminary Version) Proceedings of the first annual ACM symposium on Theory of computing, (89-92)
- Basu S On classes of computable functions Proceedings of the first annual ACM symposium on Theory of computing, (55-59)
- Blum M On effective procedures for speeding up algorithms Proceedings of the first annual ACM symposium on Theory of computing, (43-53)
- Ullian J The inherent ambiguity partial algorithm problem for context free languages Proceedings of the first annual ACM symposium on Theory of computing, (19-20)
- McNaughton R (1968). Automata, formal languages abstract switching, and computability in a Ph.D. computer science program, Communications of the ACM, 11:11, (738-740), Online publication date: 1-Nov-1968.
- Atchison W, Conte S, Hamblen J, Hull T, Keenan T, Kehl W, McCluskey E, Navarro S, Rheinboldt W, Schweppe E, Viavant W and Young D (1968). Curriculum 68: Recommendations for academic programs in computer science, Communications of the ACM, 11:3, (151-197), Online publication date: 1-Mar-1968.
Index Terms
- Theory of recursive functions and effective computability
Recommendations
Finitely Bounded Effective Computability
One of the most important property of the computability is the certainty. For example a set of natural numbers is computable if there is a Turing machine which decides certainly if a given natural number belongs to the set or not, and no wrong answers ...
Type-2 Computability and Moore's Recursive Functions
Regarding effectivity of functions on the reals, there have been several proposed models of analog, continuous-time computation, as opposed to the digital, discrete nature of the type-2 computability. We study one of them, Moore's real (primitive) ...
Reviews
Gregory E. Minc
This is a paperback edition of a monograph that appeared in 1967. It quickly became (and still is) the basic graduate-level textbook and one of the main reference sources on the subject. The only changes made in the present edition are the correction of typographical errors and the indication of statements or questions in the text (chiefly in the exercises) that are incorrect or out of date. Comparatively elementary general notions and results on computability are covered in great detail. The complexity theory of computable functions, which has flourished during the last 20 years, is only touched upon, but most research papers in that area implicitly rely on the ideas and results in this book. Readers may wish to consult a more recent treatment of recursion theory by Soare [1].
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.