Titlebook: Constructivity in Computer Science; Summer Symposium, Sa J. Paul Myers,Michael J. O‘Donnell Conference proceedings 1992 Springer-Verlag Ber

Osteoporosis

生氣地

褪色

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/236143.jpg

hardheaded

Constructivity in Computer Science978-3-540-47265-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

Jingoism

parsimony

chemoprevention

Klaus P. Nührich,Alexandra Hauser reduce to the classical notion of recursive enumerability over the natural numbers. By working in the algebra of the reals, with and without order, we find examples of sets which distinguish between these three notions. We also find interesting examples of sets of real and complex numbers which are semicomputable but not computable.

重力

MOAT

HUMP