Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

JSYML
2008

favoriteEmaildiscussreport

44views more JSYML 2008»

Prime models of computably enumerable degree

13 years 10 months ago

Prime models of computably enumerable degree

Download www.lc08.iam.unibe.ch

Rachel Epstein

Real-time Traffic

JSYML 2008 |

claim paper

Related Content

» Upper bounds on ideals in the computably enumerable Turing degrees

» Prime clauses for fast enumeration of satisfying assignments to boolean circuits

» The degree spectra of homogeneous models

» Computational processes observers and Turing incompleteness

» Spectral Analysis of Attractors in Random Boolean Network Models

» On Computing Backbones of Propositional Theories

» Spectra of Algebraic Fields and Subfields

» On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity

» Complexity of Probabilistic Planning under Average Rewards

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JSYML
Authors	Rachel Epstein

Comments (0)