#### Filter Results:

- Full text PDF available (1)

#### Publication Year

1992

2001

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

J.Barzdin [Bar74] has proved that there are classes of total recursive {unctions which are FX-identifiable but their union is not. We prove that there are no 3 classes U I, U~, U s such that U~uU 2, UIuU 3, and U2uU s would be in EX but UIMU2uU3~ EX. For FINidentification there are 3 classes with the above-mentioned properly and there are no 4 classes Uj, U… (More)

- Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs
- Theor. Comput. Sci.
- 2001

In this paper we investigate in which cases unions of identi$able classes are also necessarily identi$able. We consider identi$cation in the limit with bounds on mindchanges and anomalies. Though not closed under the set union, these identi$cation types still have features resembling closedness. For each of them we $nd n such that (1) if every union of n −… (More)

- Raimonds Simanovskis
- Elektronische Informationsverarbeitung und…
- 1994

- ‹
- 1
- ›