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

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

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

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

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

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

EIN REKURSIVDEFINIERTES GEORDNETES PAAR. = UNE PAIRE ORDONNEE DEFINIE RECURSIVEMAURER C.1976; Z. MATH. LOGIK GRUNDL. MATH.; DTSCH.; DA. 1976; VOL. 22; NO 3; PP. 211-214; BIBL. 5 REF.Article

THE THEORY OF RECURSIVE FUNCTIONS, APPROACHING ITS CENTENNIALKLEENE SC.1981; BULL. AM. MATH. SOC.; ISSN 0002-9904; USA; DA. 1981; VOL. 5; NO 1; PP. 43-61; BIBL. 3 P.Article

ORIGINS OF RECURSIVE FUNCTION THEORYKLEENE SC.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 371-382; BIBL. 3 P.Conference Paper

EIN NORMALFORMENTHEOREM FUER SIGMA ₂-FUNKTIONEN = UN THEOREME DE FORME NORMALE POUR DES FONCTIONS SIGMA ₂KLETTE R; GOETZE B.1978; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1978; VOL. 14; NO 5; PP. 251-256; ABS. ENG/RUS; BIBL. 6 REF.Article

RELATIONS ENTRE LES DIFFERENTS TYPES DE CALCULABILITE RELATIVE DES FONCTIONSPOLYAKOV EA; ROZINAS MG.1978; MAT. SBOR; SUN; DA. 1978; VOL. 107; NO 1; PP. 134-145; BIBL. 11 REF.Article

BUSY BEAVER SETS: CHARACTERIZATIONS AND APPLICATIONSDALEY RP.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 1; PP. 52-67; BIBL. 10 REF.Article

CONSTRUCTIVELY NONPARTIAL RECURSIVE FUNCTIONSHOROWITZ BM.1980; NOTRE DAME J. FORM. LOGIC; USA; DA. 1980; VOL. 21; NO 2; PP. 273-276; BIBL. 3 REF.Article

CARACTERE QUASI DE PEANO DES FONCTIONS RECURSIVESMARCHENKOV SS.1979; PROBL. KIBERN.; SUN; DA. 1979; NO 35; PP. 199-204; BIBL. 6 REF.Article

INDEXMENGEN UND ERKENNUNG REKURSIVER FUNKTIONEN. = ENSEMBLES D'INDICES ET RECONNAISSANCE DE FONCTIONS RECURSIVESKLETTE R.1976; Z. MATH. LOGIK GRUNDL. MATH.; DTSCH.; DA. 1976; VOL. 22; NO 3; PP. 231-238; BIBL. 10 REF.Article

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

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