Computability and Models: Perspectives East and West
153.15 CHF
Versandkostenfrei
Lieferzeit: 21 Werktage
- Artikel-Nr.: 10192683
Beschreibung
Preface. Contributing Authors. Introduction; P. Odifreddi. Truth-Table Complete Computably Enumerable Sets; M.M. Arslanov. Completeness and Universality of Arithmetical Numbering; S. Badaev, et al. Algebraic Properties of Rogers Semilattices of Arithmetical Numberings; S. Badaev, et al. Isomorphism Types and Theories of Rogers Semilattices of Arithmetical Numberings; S. Badaev, et al. Computability over Topological Structures; V. Brattka. Incomputability In Nature; S.B. Cooper, P. Odifreddi. Gems in the Field of Bounded Queries; W. Gasarch. Finite End Intervals in Definable Quotients of Epsilon; E. Herrmann. A Tour of Robust Learning; S. Jain, F. Stephan. On Primitive Recursive Permutations; I. Kalimullin. On Self-Embeddings of Computable Linear Orders; S. Lempp, et al. Definable Relations on the Computably Enumerable Degrees; A. Li. Quasi-Degrees of Recursively Enumerable Sets; R.Sh. Omanadze. Positive Structures; V. Selivanov. Local Properties of the Non-Total Enumeration Degrees; B. Solon. References.
Eigenschaften
Gewicht: | 800 g |
Höhe: | 235 |
Seiten: | 375 |
Sprachen: | Englisch |
Autor: | Barry S. Cooper, Sergei S. Goncharov |
Bewertung
Bewertungen werden nach Überprüfung freigeschaltet.
Zuletzt angesehen