On the power of probabilistic strategies in inductive inferenceWIEHAGEN, R; FREIVALDS, R; KINBER, E. B et al.Theoretical computer science. 1984, Vol 28, Num 1-2, pp 111-133, issn 0304-3975Article

A theory of recursive dimension for ordered setsKIERSTEAD, H. A; MCNULTY, G. F; TROTTER, W. T. JR et al.Order (Dordrecht). 1984, Vol 1, Num 1, pp 67-82, issn 0167-8094Article

Hierarchies of primitive recursive wordsequence functions: comparisons and decision problemsFACHINI, E; NAPOLI, M.Theoretical computer science. 1984, Vol 29, Num 1-2, pp 185-227, issn 0304-3975Article

Closure properties of almost-finiteness classes in recursive function theoryROLLETSCHEK, H.The Journal of symbolic logic. 1983, Vol 48, Num 3, pp 756-763, issn 0022-4812Article

What's in a function ?ANTONELLI, G. A.Synthese (Dordrecht). 1996, Vol 107, Num 2, pp 204-3167, issn 0039-7857Article

Reflective inductive inference of recursive functionsGRIESER, Gunter.Lecture notes in computer science. 2002, pp 203-217, issn 0302-9743, isbn 3-540-00170-0, 15 p.Conference Paper

The dynamic universality of sigmoidal neural networksKILIAN, J; SIEGELMANN, H. T.Information and computation (Print). 1996, Vol 128, Num 1, pp 48-56, issn 0890-5401Article

The lack of definable witnesses and provably recursive functions in intuitionistic set theoriesFRIEDMAN, H. M; SCEDROV, A.Advances in mathematics (New York, NY. 1965). 1985, Vol 57, Num 1, pp 1-13, issn 0001-8708Article

P-selectivity, immunity, and the power of one bitHEMASPAANDRA, Lane A; TORENVLIET, Leen.Lecture notes in computer science. 2006, pp 323-331, issn 0302-9743, isbn 3-540-31198-X, 1Vol, 9 p.Conference Paper

Learning how to separateJAIN, Sanjay; STEPHAN, Frank.Theoretical computer science. 2004, Vol 313, Num 2, pp 209-228, issn 0304-3975, 20 p.Conference Paper

Classes with easily learnable subclassesJAIN, Sanjay; MENZEL, Wolfram; STEPHAN, Dank et al.Lecture notes in computer science. 2002, pp 218-232, issn 0302-9743, isbn 3-540-00170-0, 15 p.Conference Paper

Characterization of the computable real numbers by means of primitive recursive functionsSKORDEV, Dimiter.Lecture notes in computer science. 2001, pp 296-309, issn 0302-9743, isbn 3-540-42197-1Conference Paper

Recursion theorems and effective domainsKANDA, A.Annals of pure and applied logic. 1988, Vol 38, Num 3, pp 289-300, issn 0168-0072Article

On the minimality of tame models in the isolsBARBACK, J.Proceedings of the American Mathematical Society. 1993, Vol 119, Num 3, pp 935-939, issn 0002-9939Article

On co-simple isols and their intersection typesDOWNEY, R; SLAMAN, T. A.Annals of pure and applied logic. 1992, Vol 56, Num 1-3, pp 221-237, issn 0168-0072Article

Effective choice functions and index setsOWINGS, J. C. JR.Journal of computer and system sciences (Print). 1986, Vol 32, Num 3, pp 370-373, issn 0022-0000Article

Notions of weak genericityKURTZ, S. A.The Journal of symbolic logic. 1983, Vol 48, Num 3, pp 764-770, issn 0022-4812Article

Merging uniform inductive learnersZILLES, Sandra.Lecture notes in computer science. 2002, pp 201-215, issn 0302-9743, isbn 3-540-43836-X, 15 p.Conference Paper

A mod-n Ackermann function, or what's so special about 1969?FROEMKE, J; GROSSMAN, J. W.The American mathematical monthly. 1993, Vol 100, Num 2, pp 180-183, issn 0002-9890Article

A syntactical definition of the #7B-P=? #7B-N#7B-P problemAMIR, A; CHOUEKA, Y.International journal of computer mathematics. 1985, Vol 17, Num 3, pp 217-228, issn 0020-7160Article

Training sequencesANGLUIN, D; GASARCH, W. I; SMITH, C. H et al.Theoretical computer science. 1989, Vol 66, Num 3, pp 255-272, issn 0304-3975Article

Solving nontrivial recursive equations on a microcomputerPARK, K. S.IEEE transactions on reliability. 1985, Vol 34, Num 5, pp 561-562, issn 0018-9529Article

Church's thesis and cognitive scienceNELSON, R. J.Notre Dame journal of formal logic. 1987, Vol 28, Num 4, pp 581-614, issn 0029-4527Article

Deciding inductive validity of equationsGIESL, Jürgen; KAPUR, Deepak.Lecture notes in computer science. 2003, pp 17-31, issn 0302-9743, isbn 3-540-40559-3, 15 p.Conference Paper

Machine induction without revolutionary changes in hypothesis sizeCASE, J; JAIN, S; SHARMA, A et al.Information and computation (Print). 1996, Vol 128, Num 2, pp 73-86, issn 0890-5401Article