Sciweavers

528 search results - page 2 / 106
» Degrees of categoricity of computable structures
Sort
View
68
Voted
JSYML
2007
95views more  JSYML 2007»
14 years 9 months ago
Applications of Kolmogorov complexity to computable model theory
In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not ℵ0-categorical saturated structure with a unique com...
Bakhadyr Khoussainov, Pavel Semukhin, Frank Stepha...
APAL
2010
85views more  APAL 2010»
14 years 9 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
67
Voted
APAL
2006
57views more  APAL 2006»
14 years 9 months ago
Effective categoricity of equivalence structures
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence c...
Wesley Calvert, Douglas Cenzer, Valentina S. Hariz...
VISAPP
2010
14 years 7 months ago
The Structural Form in Image Categorization
Juha Hanni, Esa Rahtu, Janne Heikkilä
CIE
2007
Springer
15 years 3 months ago
Some Notes on Degree Spectra of the Structures
Iskander Sh. Kalimullin