11 search results - page 1 / 3 » Prime models of computably enumerable degree |
JSYML
2008
13 years 5 months ago
2008
APAL
2011
13 years 24 days ago
2011
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
DAC
2005
ACM
13 years 7 months ago
2005
ACM
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
JSYML
2008
13 years 4 months ago
2008
Much previous study has been done on the degree spectra of prime models of a complete atomic decidable theory. Here we study the analogous questions for homogeneous models. We say...
TCS
2011
13 years 21 days ago
2011
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...