Algorithmic Stability of Models
Bakh Khoussainov, Ruzmat Normatovich Dadazhanov · Birkhäuser Boston eBooks · 1993
In the first part of this paper we investigate relations between different types of algorithmic dimensions of models. We prove that there exists a recursive model which has different program and uniform dimensions . We find some conditions which are sufficient for systems to have the same uniform and program dimensions. In the second part the notion of finitely blocked models is given. We give an algebraic characterization of strongly finitely blocked algebraically stable systems in terms of notions of partially ordered sets, and investigate the problem of the number of recursive isomorphism types of finitely blocked models. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.