Sciweavers

14704 search results - page 151 / 2941
» computing 2007
Sort
View
ENTCS
2007
91views more  ENTCS 2007»
15 years 3 months ago
A Cappable Almost Everywhere Dominating Computably Enumerable Degree
We show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair.
George Barmpalias, Antonio Montalbán
CACM
2007
164views more  CACM 2007»
15 years 3 months ago
Is abstraction the key to computing?
ACTION THE KEY TO COMPUTING? Why is it that some software engineers and computer scientists are able to produce clear, elegant designs and programs, while others cannot? Is it poss...
Jeff Kramer