| Creator |
|
| Language |
|
| Publisher |
|
|
|
| Date |
|
| Source Title |
|
| Vol |
|
| Issue |
|
| First Page |
|
| Last Page |
|
| Publication Type |
|
| Access Rights |
|
| Crossref DOI |
|
| Related DOI |
|
|
|
| Related URI |
|
|
|
| Relation |
|
|
|
| Abstract |
Inductive inference is a process of gaining a general rule from examples. Inductive inference of recursive functions from input-output examples is considered. An iteratively working strategy utilizes ...the last hypothesis produced by it and the present example, and a consistent strategy always produces a program consistent with all examples received so far. An extension of the uniformly bounded number of hypotheses utilized by strategies is shown to lead to no extension of the inferring power. We also show that the technique of $ EX^n $-hierarchy holds for iteratively working and consistent strategies with anomalies.show more
|
Export Mendeley
p171