Get started
Author

Andrew E. M. Lewis

Observed names: A. E. M. Lewis, A.E.M. Lewis, ANDREW E. M. LEWIS, Andrew E.M. Lewis, Andrew Lewis, Lewis, Andrew Edwin Marcus
OpenAlex ID: A5111765854
A fixed-point-free minimal degree
2009 · Masahiro Kumabe, Andrew E. M. Lewis · Journal of the London Mathematical Society · 33
Randomness, lowness and degrees
2008 · George Barmpalias, Andrew E. M. Lewis, et al. · Journal of Symbolic Logic · 27
The ibT degrees of computably enumerable sets are not dense
2005 · George Barmpalias, Andrew E.M. Lewis · Annals of Pure and Applied Logic · 22
The importance of Π10 classes in effective randomness
2010 · George Barmpalias, Andrew E.M. Lewis, et al. · Journal of Symbolic Logic · 18
Π10 classes, LR degrees and Turing degrees
2008 · George Barmpalias, Andrew E.M. Lewis, et al. · Annals of Pure and Applied Logic · 16
Randomness and the linear degrees of computability
2006 · Andrew E.M. Lewis, George Barmpalias · Annals of Pure and Applied Logic · 15
PDF
Random reals and Lipschitz continuity
2006 · ANDREW E. M. LEWIS, GEORGE BARMPALIAS · Mathematical Structures in Computer Science · 15
A C.E. Real That Cannot Be SW-Computed by Any Ω Number
2006 · George Barmpalias, Andrew E. M. Lewis · Notre Dame Journal of Formal Logic · 15
Π10 classes, strong minimal covers and hyperimmune-free degrees
2007 · Andrew E. M. Lewis · Bulletin of the London Mathematical Society · 14
PDF
Diagonally Non-Computable Functions and Bi-Immunity
2013 · Carl G. Jockusch, Andrew E. M. Lewis · Journal of Symbolic Logic · 12
Chaitin's halting probability and the compression of strings using oracles
2011 · George Barmpalias, Andrew E. M. Lewis · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · 11
Topological aspects of the Medvedev lattice
2010 · Andrew E. M. Lewis, Richard A. Shore, et al. · Archive for Mathematical Logic · 11
On the degree spectrum of a $\Pi ^0_1$ class
2010 · Thomas Kent, Andrew E. M. Lewis · Transactions of the American Mathematical Society · 9
PDF
Analogues of Chaitinʼs Omega in the computably enumerable sets
2013 · G. Barmpalias, R. Hölzl, et al. · Information Processing Letters · 8
Strong minimal covers and a question of Yates: The story so far
2009 · Andrew E. M. Lewis · Cambridge University Press eBooks · 7
A random degree with strong minimal cover
2007 · Andrew E. M. Lewis · Bulletin of the London Mathematical Society · 6
The minimal complementation property above 0′
2005 · Andrew E. M. Lewis · Mathematical logic quarterly · 6
Properties of the jump classes
2010 · A. E. M. Lewis · Journal of Logic and Computation · 4
Joining up to the generalized high degrees
2010 · Philip Ellison, Andrew Lewis · Proceedings of the American Mathematical Society · 4
PDF
On a question of Slaman and Groszek
2008 · Andrew Lewis · Proceedings of the American Mathematical Society · 3
PDF
Properly ?2 minimal degrees and 0? complementation
2005 · S. Barry Cooper, Andrew E. M. Lewis, et al. · Mathematical logic quarterly · 3
Measure and cupping in the Turing degrees
2012 · George Barmpalias, Andrew E. M. Lewis · Proceedings of the American Mathematical Society · 2
PDF
Empty intervals in the enumeration degrees
2011 · Thomas F. Kent, Andrew E.M. Lewis, et al. · Annals of Pure and Applied Logic · 2
PDF
1 classes,LRdegrees and Turing degrees
2008 · George Barmpalias, Andrew E. M. Lewis, et al. · 2
The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees
2006 · George Barmpalias, Andrew E. M. Lewis · Notre Dame Journal of Formal Logic · 2
PDF
Works count: 32
Citation count: 270
H-index: 11
I10-index: 12
Year
Topic
Type