ABSTRACT
Consider the empirical laws established in the History of Science. The process of scientific discovery can be roughly explained by (Popper-Kuhn's) cycle which starts with collecting evidence, introducing a model to explain observations, predicting further observations, and confronting them with experimentation, reinforcing or disproving the model. We attempt to prove that the empirical evidence modeled by arithmetical operations can be automatically discovered with a small amount of information, i.e. with very short Blums' locking sequences, due to the suitable enumerations of arithmetical functions.
Disclosure statement
No potential conflict of interest was reported by the author(s).
Notes
1 The operation corresponds to the subtraction for the natural numbers, i.e. we have that
2 We use to denote tuples .
3 Note that ; for 0<z<y we have .
4 comes from Explain.
5 In the standard context of learning theory, we take , and we have converging to e on and, for all , .
6 The algorithm used in Section 6.2 will present a better computational time. Since the description for the distance function is larger than the one for the product we will not proceed to experiment with that function.
7 The source code of these projects on automata can be found in https://github.com/gamatos/gold and https://github.com/chengandre/Reg, respectively.