| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| Crossref DOI |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
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.続きを見る
|
Mendeley出力
