Search Sciweavers | Sciweavers

528 search results - page 2 / 106

» Degrees of categoricity of computable structures

click to vote

JSYML
2007

95views more JSYML 2007»

Applications of Kolmogorov complexity to computable model theory

13 years 7 months ago

Download semukhin.name

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...

claim paper

Read More »

click to vote

APAL
2010

85views more APAL 2010»

Elementary differences between the degrees of unsolvability and degrees of compressibility

13 years 7 months ago

Download www.barmpalias.net

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

claim paper

Read More »

click to vote

APAL
2006

57views more APAL 2006»

Effective categoricity of equivalence structures

13 years 7 months ago

Download home.gwu.edu

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...

claim paper

Read More »

click to vote

VISAPP
2010

122views Computer Vision» more VISAPP 2010»

The Structural Form in Image Categorization

13 years 5 months ago

Download www.ee.oulu.fi

Juha Hanni, Esa Rahtu, Janne Heikkilä

claim paper

Read More »