Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Kalvis Apsitis"'
Publikováno v:
Information and Computation. 129(1):53-62
Previous work in inductive inference dealt mostly with finding one or several machines (IIMs) that successfully learn collections of functions. Herein we start with a class of functions and considerthe learner setof all IIMs that are successful at le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ebe1c2f531cc1911c128a76f461e82a9
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540650133
ALT
ALT
In this paper we investigate in which cases unions of identifiable classes of recursive functions are also necessarily identifiable. We consider identification in the limit with bounds on mindchanges and anomalies. Though not closed under the set uni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11a7d61aa061937f5076f9de3da88964
https://doi.org/10.1007/3-540-49730-7_4
https://doi.org/10.1007/3-540-49730-7_4
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540633570
COCOON
COCOON
We consider k-tape 1-way alternating finite automata (k-tape lafa). We say that an alternating automaton accepts a language L\(\subseteq\)(Σ*)k with f(n)-bounded maximal (respectively, minimal) leaf-size if arbitrary (respectively, at least one) acc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b7c843b783c634075f62a599b73bb94
https://doi.org/10.1007/bfb0045109
https://doi.org/10.1007/bfb0045109
Autor:
Cristian S. Calude, Andris Ambainis, Kalvis Apsitis, Marek Karpinski, Iveta Sala, Tomas Larfeldt, Rusins Freivalds, Juris Smotrovs
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540635772
ALT
ALT
For all complexity measures in Kolmogorov complexity the effect discovered by P. Martin-Lof holds. For every infinite binary sequence there is a wide gap between the supremum and the infimum of the complexity of initial fragments of the sequence. It
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d82c71a2c54cc45ca2e268f4feb91d48
https://doi.org/10.1007/3-540-63577-7_47
https://doi.org/10.1007/3-540-63577-7_47
Publikováno v:
Grammatical Interference: Learning Syntax from Sentences ISBN: 9783540617785
ICGI
ICGI
This paper deals with the satisfiability of requirements put on the identifiability of unions of language families. We consider identification in the limit from a text with bounds on mindchanges and anomalies. We show that, though these identificatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09dd9950afc79986cf8813eef00b0c04
https://doi.org/10.1007/bfb0033341
https://doi.org/10.1007/bfb0033341
Autor:
Kalvis Apsitis
Publikováno v:
Algorithmic Learning for Knowledge-Based Systems ISBN: 9783540602170
GOSLER Final Report
GOSLER Final Report
Classes of total recursive functions may be identifiable by a team of strategies, but not by a single strategy, in accordance with a certain identification type (EX, FIN, etc.). Qualitative aspects in composing teams are considered. For each W ∉ EX
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69bf34d583f3ffc843fbf72588c89d23
https://doi.org/10.1007/3-540-60217-8_8
https://doi.org/10.1007/3-540-60217-8_8
Autor:
Kalvis Apsitis
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540585206
AII/ALT
AII/ALT
The paper deals with using topological concepts in studies of the Gold paradigm of inductive inference. They are — accumulation points, derived sets of order α (α — constructive ordinal) and compactness. Identifiability of a class U of total re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b38fba00174fbba21c4009a6eaac654c
https://doi.org/10.1007/3-540-58520-6_51
https://doi.org/10.1007/3-540-58520-6_51
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540573708
ALT
ALT
Our goal through several years has been the development of efficient search algorithm for inductive inference of expressions using only input/output examples. The idea is to avoid exhaustive search by means of taking full advantage of semantic equali
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aece0a0b3ac78034c5a8ef04eb8f4fa4
https://doi.org/10.1007/3-540-57370-4_37
https://doi.org/10.1007/3-540-57370-4_37
Publikováno v:
Analogical and Inductive Inference ISBN: 9783540560043
AII
AII
J.Barzdin [Bar74] has proved that there are classes of total recursive functions which are EX-identifiable but their union is not. We prove that there are no 3 classes U1, U2, U3 such that U1∪U2,U1∪U3 and U2∪U3 would be in EX but U1∪U2∪U3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c26ee86ba3555e625dddf98a891ea51f
https://doi.org/10.1007/3-540-56004-1_7
https://doi.org/10.1007/3-540-56004-1_7
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.