论文信息 - Inductive Inference and Computable One-One Numberings - 字舞流文

Inductive Inference and Computable One-One Numberings

Rusins Freivalds | Rolf Wiehagen | Efim B. Kinber

[1] Dana Angluin,et al. Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..

[2] Rolf Wiehagen,et al. Characterization Problems in the Theory of Inductive Inference , 1978, ICALP.

[3] R. V. Freivald. Minimal Gödel Numbers and Their Identification in the Limit , 1975, MFCS.

[4] Manuel Blum,et al. Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..

[5] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..

[6] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[7] Carl Herbert Smith. Hierarchies of identification criteria for mechanized inductive inference. , 1979 .

[8] Richard M. Friedberg,et al. Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication , 1958, Journal of Symbolic Logic.

[9] Yu. V. Pleskov,et al. Russian Text Ignored , 1962 .