References
- Kemeny JG. A philosopher looks at science. Singapore: Van Nostrand; 1959.
- Langley P, Simon HA, Bradshaw GL, et al. Scientific discovery: computational explorations of the creative process. Cambridge (MA): MIT Press; 1987.
- Kelly KT. The logic of reliable inquiry. USA: Oxford University Press; 1996.
- Szudzik MP. The computable universe hypothesis. In: A Computable universe: understanding and exploring nature as computation. World Scientific; 2013. p. 479–523.
- Case J. Algorithmic scientific inference. Int J Unconv Comput. 2012;8(3):192–206.
- Gold EM. Language identification in the limit. Inf Control. 1967;10(5):447–474. doi: 10.1016/S0019-9958(67)91165-5
- Gurney K. An introduction to neural networks. Bristol (PA): Taylor & Francis, Inc.; 1997.
- Sparkes A, Aubrey W, Byrne E, et al. Toward robot scientists for autonomous scientific discovery. Autom Exp. 2010;2:11 pages, 1. doi: 10.1186/1759-4499-2-1
- Bilsland E, van Vliet L, Williams K, et al. Plasmodium dihydrofolate reductase is a second enzyme target for the antimalarial action of triclosan. Sci Rep. 2018;8(1):1038. doi: 10.1038/s41598-018-19549-x
- King RD, Rowland J, Oliver SG, et al. The automation of science. Science. 2009;324(5923):85–89. doi: 10.1126/science.1165620
- Kitano H. Artificial intelligence to win the nobel prize and beyond: creating the engine for scientific discovery. AI Mag. 2016;37(1):39–49.
- Handley WG, Wainer SS. Complexity of primitive recursion. In: Berger U, Schwichtenberg H, editors, Computational logic. Berlin, Heidelberg: Springer Berlin Heidelberg; 1999. p. 273–300.
- Meyer AR, Ritchie DM. The complexity of loop programs. In: Proceedings of the 1967 22nd National Conference; New York: ACM; 1967. p. 465–469.
- Cutland N. Computability: an introduction to recursive function theory. Cambridge, UK: Cambridge University Press; 1980.
- Jain S, Osherson DN, Royer JS, et al. Systems that learn. An introduction to learning theory. 2nd ed. Cambridge, Massachusetts: The MIT Press; 1999.
- Osherson DN, Stob M, Weinstein S. Systems that learn: an introduction to learning theory for cognitive and computer scientists. 2nd ed. Cambridge, Massachusetts: The MIT Press; 1986.
- Costa JF. On discovering scientific laws. Int J Unconv Comput. 2019;14(3–4):285–318.
- Blum L, Blum M. Toward a mathematical theory of inductive inference. Inf Control. 1975;28(2): 125–155. doi: 10.1016/S0019-9958(75)90261-2
- Bell JL, Machover M. A course in mathematical logic. Amsterdam: Elsevier; 1977.
- Avigad J. Notes on recursive functions [Unpublished]. Revised and expanded by R. Zach.
- Ewert W. Enumerating the primitive recursive functions. Software Engineering Stack Exchange. Version 2016-02-13. Available from: https://softwareengineering.stackexchange.com/a/310061.
- Kahrs S. The primitive recursive functions are recursively enumerable. University of Kent at Canterbury, Department of Computer Science X, 200; 2008 Jan.
- Liu S-C. An enumeration of the primitive recursive functions without repetition. Tohoku Math J (2). 1960;12(3):400–402. doi: 10.2748/tmj/1178244403
- Cheng A. Identification of regular languages with computable scientists [Graduation project]. Instituto Superior Técnico, University of Lisbon; 2023.
- Matos G. An exhaustive algorithm for minimum state automaton identification [Graduation project]. Instituto Superior Técnico, University of Lisbon; 2019.