Skip to main content

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
Cancel
×
×
Home
  • Home
Chapter
  • Online publication date: March 2017

Learning and computing in the limit

Export citation
Recommend this book

Email your librarian or administrator to recommend adding this book to your organisation's collection.

Logic Colloquium '02
  • Online ISBN: 9781316755723
  • Book DOI: https://doi.org/10.1017/9781316755723
Please enter your name
Please enter a valid email address
Who would you like to send this to *

CAPTCHA *

Skip to the audio challenge
×
[1] W., Gasarch, M., Pleszkoch, F., Stephan, and M., Velauthapillai, Classification using information Annals of Mathematics and Artificial Intelligence, vol. 23 (1998), pp. 147–168.
[2] E. M., Gold, Limiting recursion The Journal of Symbolic Logic, vol. 30 (1965), pp. 28–48.
[3] E. M., Gold, Language identification in the limit Information and Control, vol. 10 (1967), pp. 447–474.
[4] S., Hayashi, Limit computable mathematics, www.shayashi.jp/PALCM/index-eng.html.
[5] H. J., Keisler, Fundamentals of model theory Handbook of Mathematical Logic (J. Barwise, editor), North-Holland, 1978, pp. 47–103.
[6] K., Kelly, The Logic of Reliable Inquiry, Oxford University Press, 1995.
[7] E., Martin and D., Osherson, Scientific discovery based on belief revision The Journal of Symbolic Logic, vol. 62(4) (1997), pp. 1352–1370.
[8] E., Martin and D., Osherson, Elements of Scientific Inquiry, MIT Press, 1998.
[9] P. G., Odifreddi, Classical Recursion Theory, Studies in logic and the foundations of mathematics Vol. 125 and Vol. 143, North-Holland, 1989, 1999.
[10] D., Osherson, D., de Jongh, E., Martin, and S., Weinstein, Formal learning theory Handbook of Logic and Language (J., van Benthem and A., ter Meulen, editors), Elsevier, 1997, pp. 737–775.
[11] D., Osherson, M., Stob, and S., Weinstein, A universal inductive inference machine The Journal of Symbolic Logic, vol. 56(2) (1991), pp. 661–672.
[12] D., Osherson and S., Weinstein, Identification in the limit of first order structures Journal of Philosophical Logic, vol. 15 (1986), pp. 55–81.
[13] D., Osherson and S., Weinstein, Paradigms of truth detection Journal of Philosophical Logic, vol. 18 (1989), pp. 1–42.
[14] H., Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, 1967.
[15] J. R., Shoenfield, On degrees of unsolvability Annals of Mathematics, vol. 69 (1959), pp. 644–653.
[16] R. I., Soare, Recursively Enumerable Sets and Degrees, Springer, 1987.
[17] F. C., Stephan, One-sided versus two-sided classification Archive for Mathematical Logic, vol. 40 (2001), pp. 489–513.
[18] F. C., Stephan and S. A., Terwijn, The complexity of universal text-learners Information and Computation, vol. 154(2) (1999), pp. 149–166.
Cancel
Confirm
×