Book contents
- Frontmatter
- Contents
- Preface
- Participants Photograph
- Generic absoluteness for Σ1 formulas and the continuum problem
- Axioms of generic absoluteness
- Generalised dynamic ordinals — universal measures for implicit computational complexity
- The Worm principle
- “One is a lonely number”: logic and communication
- Computable versions of the uniform boundedness theorem
- Symmetry of the universal computable function: A study of its automorphisms, homomorphisms and isomorphic embeddings
- PCF theory and Woodin cardinals
- Embedding finite lattices into the computably enumerable degrees — a status survey
- Dimension theory inside a homogeneous model
- Reals which compute little
- Bisimulation invariance and finite models
- Choice principles in constructive and classical set theories
- Ash's theorem for abstract structures
- Martin-Löf random and PA-complete sets
- Learning and computing in the limit
- References
Learning and computing in the limit
Published online by Cambridge University Press: 31 March 2017
Book contents
- Frontmatter
- Contents
- Preface
- Participants Photograph
- Generic absoluteness for Σ1 formulas and the continuum problem
- Axioms of generic absoluteness
- Generalised dynamic ordinals — universal measures for implicit computational complexity
- The Worm principle
- “One is a lonely number”: logic and communication
- Computable versions of the uniform boundedness theorem
- Symmetry of the universal computable function: A study of its automorphisms, homomorphisms and isomorphic embeddings
- PCF theory and Woodin cardinals
- Embedding finite lattices into the computably enumerable degrees — a status survey
- Dimension theory inside a homogeneous model
- Reals which compute little
- Bisimulation invariance and finite models
- Choice principles in constructive and classical set theories
- Ash's theorem for abstract structures
- Martin-Löf random and PA-complete sets
- Learning and computing in the limit
- References
- Type
- Chapter
- Information
- Logic Colloquium '02 , pp. 349 - 359Publisher: Cambridge University PressPrint publication year: 2006
References
[1] , , , and , Classification using information Annals of Mathematics and Artificial Intelligence, vol. 23 (1998), pp. 147–168.
[2] , Limiting recursion The Journal of Symbolic Logic, vol. 30 (1965), pp. 28–48.
[3] , Language identification in the limit Information and Control, vol. 10 (1967), pp. 447–474.
[4] , Limit computable mathematics, www.shayashi.jp/PALCM/index-eng.html.
[5] , Fundamentals of model theory Handbook of Mathematical Logic (J. Barwise, editor), North-Holland, 1978, pp. 47–103.
[6] , The Logic of Reliable Inquiry, Oxford University Press, 1995.
[7] and , Scientific discovery based on belief revision The Journal of Symbolic Logic, vol. 62(4) (1997), pp. 1352–1370.
[8] and , Elements of Scientific Inquiry, MIT Press, 1998.
[9] , Classical Recursion Theory, Studies in logic and the foundations of mathematics Vol. 125 and Vol. 143, North-Holland, 1989, 1999.
[10] , , , and , Formal learning theory Handbook of Logic and Language ( and , editors), Elsevier, 1997, pp. 737–775.
[11] , , and , A universal inductive inference machine The Journal of Symbolic Logic, vol. 56(2) (1991), pp. 661–672.
[12] and , Identification in the limit of first order structures Journal of Philosophical Logic, vol. 15 (1986), pp. 55–81.
[13] and , Paradigms of truth detection Journal of Philosophical Logic, vol. 18 (1989), pp. 1–42.
[14] , Theory of Recursive Functions and Effective Computability, McGraw-Hill, 1967.
[15] , On degrees of unsolvability Annals of Mathematics, vol. 69 (1959), pp. 644–653.
[16] , Recursively Enumerable Sets and Degrees, Springer, 1987.
[17] , One-sided versus two-sided classification Archive for Mathematical Logic, vol. 40 (2001), pp. 489–513.
[18] and , The complexity of universal text-learners Information and Computation, vol. 154(2) (1999), pp. 149–166.