6533b7cefe1ef96bd12579cd
RESEARCH PRODUCT
Enumerable classes of total recursive functions: Complexity of inductive inference
Andris AmbainisJuris Smotrovssubject
Discrete mathematicsClass (set theory)Mathematics::CombinatoricsTheoretical computer scienceRecursively enumerable setRecursive functionsEnumerationInductive reasoningMathematicsdescription
This paper includes some results on complexity of inductive inference for enumerable classes of total recursive functions, where enumeration is considered in more general meaning than usual recursive enumeration. The complexity is measured as the worst-case mindchange (error) number for the first n functions of the given class. Three generalizations are considered.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1994-01-01 |