Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Ganesh R. Baliga"'
Publikováno v:
Information and Computation. 152(1):16-43
An index for an r.e. class of languages (by definition) is a procedure which generates a sequence of grammars defining the class. An index for an indexed family of languages (by definition) is a procedure which generates a sequence of decision proced
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f3fa6e0d4285d0f0f75fea72074fec1
Autor:
Anil M. Shende, Ganesh R. Baliga
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 17:177-187
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 forme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::861993f7a63fdbfc16ac6223c05a9799
https://doi.org/10.1007/bf02127967
https://doi.org/10.1007/bf02127967
Autor:
Ganesh R. Baliga, John Case
Publikováno v:
Journal of Computer and System Sciences. 53:26-32
Presented is a surprising characterization of hypersimple sets in algorithmic learning theory. It is used herein to obtain an elegant, tight separation result for learnability criteria. It is argued that such separation results may yield insight for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae08e72aea44325a01bdf4303bbd6b4c
https://doi.org/10.1006/jcss.1996.0047
https://doi.org/10.1006/jcss.1996.0047
Publikováno v:
COLT
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04b00813ca48dc183cdd8c1f8f764bf3
https://doi.org/10.1145/238061.238090
https://doi.org/10.1145/238061.238090
Autor:
Ganesh R. Baliga, John Case
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540585206
AII/ALT
AII/ALT
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ac2eb2ea1f79ec850cb470cdd515a45
https://doi.org/10.1007/3-540-58520-6_54
https://doi.org/10.1007/3-540-58520-6_54
Autor:
John Case, Ganesh R. Baliga
Publikováno v:
Automata, Languages and Programming ISBN: 9783540569398
ICALP
ICALP
Presented is a surprising characterization of hypersimple sets in algorithmic learning theory. It is used herein to obtain an elegant, tight separation result for learnability criteria. It is argued that such separation results may yield insight for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::95ddb58fa55e4edbdd1fca86be82ab70
https://doi.org/10.1007/3-540-56939-1_80
https://doi.org/10.1007/3-540-56939-1_80
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.