Training sequences
type: Item
instance of: scholarly article
title: Training sequences
zbMATH Open document ID: 0734.68080
DOI: 10.1016/0304-3975(89)90153-9
author: Dana Angluin
author: William Gasarch
author: Carl H. Smith
published in: Theoretical Computer Science
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 03D20
zbMATH DE Number: 4215393
zbMATH Keywords: training sequences
zbMATH Keywords: inference of programs
zbMATH Keywords: recursive functions
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90153-9
OpenAlex ID: W2912731686
cites work: Q3993187
cites work: Toward a mathematical theory of inductive inference
cites work: Comparison of identification criteria for machine inductive inference
cites work: A Recursion Theoretic Approach to Program Testing
cites work: On the complexity of inductive inference
cites work: Q3877665
cites work: On the inference of sequences of functions
cites work: Language identification in the limit
cites work: Q4153600
cites work: Some natural properties of strong-identification in inductive inference
cites work: Probabilistic inductive inference
cites work: Probability and plurality for aggregations of learning machines
cites work: Gödel numberings of partial recursive functions
cites work: The Power of Pluralism for Automatic Program Synthesis
cites work: A theory of the learnable
cites work: Assessing Test Data Adequacy through Program Inference
cites work: Q4170707
cites work: On the power of probabilistic strategies in inductive inference
description: scientific article; zbMATH DE number 4215393