Sciweavers

AML
2010
104views more  AML 2010»
13 years 11 months ago
Degrees of categoricity of computable structures
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 realiz...
Ekaterina B. Fokina, Iskander Sh. Kalimullin, Russ...
TAMC
2009
Springer
14 years 6 months ago
The Extended Turing Model as Contextual Tool
Computability concerns information with a causal – typically algorithmic – structure. As such, it provides a schematic analysis of many naturally occurring situations. We look ...
S. Barry Cooper