Degrees of categoricity of computable structures

13 years 4 months ago

Download qcpages.qc.cuny.edu

Defining the degree of categoricity of a computable structure M to be the least degree d for which M is d-computably categorical, we investigate which Turing degrees can be realized as degrees of categoricity. We show that for all n, degrees d.c.e. in and above 0(n) can be so realized, as can the degree 0() .

Ekaterina B. Fokina, Iskander Sh. Kalimullin, Russ

Real-time Traffic

AML 2010 | Categoricity | Computable Structure | Turing |

claim paper

» Degree spectra and computable dimensions in algebraic structures

» An optimized approach for KNN text categorization using Ptrees

» An Approach to the Parameterization of Structure for Fast Categorization

» Applications of Kolmogorov complexity to computable model theory

» Elementary differences between the degrees of unsolvability and degrees of compressibility

» Effective categoricity of equivalence structures

» The Structural Form in Image Categorization

» Some Notes on Degree Spectra of the Structures

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2010
Where	AML
Authors	Ekaterina B. Fokina, Iskander Sh. Kalimullin, Russell Miller

Comments (0)

Sciweavers

Degrees of categoricity of computable structures

AML 2010 | Categoricity | Computable Structure | Turing |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers