Learning-theoretic perspectives of acceptable numberings

Autor:	Anil M. Shende, Ganesh R. Baliga
Rok vydání:	1996
Předmět:	Algebra Discrete mathematics Class (set theory) Recursion Artificial neural network Artificial Intelligence Computer science Applied Mathematics Finitary Independence (mathematical logic) Limit (mathematics) Control (linguistics) Focus (linguistics)
Zdroj:	Annals of Mathematics and Artificial Intelligence. 17:177-187
ISSN:	1573-7470 1012-2443
DOI:	10.1007/bf02127967
Popis:	A class of recursive functionsC islimiting standardizable, in a programming system φ, iff there is an effective procedure which, given any φ-program (in the φ-system), synthesizes in the limit acanonical φ-program which is equivalent to the former. It can arguably be expected that notions similar to the above one would be relevant toGold-style function learning, which features, among other things, the effective limiting synthesis of programs for input recursive functions. Many learning classes have been characterized in terms of variants of the above notion. In this paper, we focus on the limiting standardizability of the entire class of recursive functions inEffective programming systems. To start with, we prove the independence of this notionvis-a-vis finitary recursion theorems. Secondly, we show that this motion does not entail acceptability, in the spirit of the results of Case, Riccardi and Royer on characterizations of the samevis-a-vis programming language control structures.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::861993f7a63fdbfc16ac6223c05a9799 https://doi.org/10.1007/bf02127967 Zobrazit plný text záznamu Full text from SpringerLink