Andrew E. M. Lewis

According to our database, Andrew E. M. Lewis authored at least 21 papers between 1991 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

Diagonally non-computable functions and bi-immunity.

Carl G. Jockusch Jr., Andrew E. M. Lewis

J. Symb. Log., 2013

Analogues of Chaitin's Omega in the computably enumerable sets.

George Barmpalias, Rupert Hölzl, Andrew E. M. Lewis, Wolfgang Merkle

Inf. Process. Lett., 2013

2012

Properties of the jump classes.

Andrew E. M. Lewis

J. Log. Comput., 2012

Empty intervals in the enumeration degrees.

Thomas F. Kent, Andrew E. M. Lewis, Andrea Sorbi

Ann. Pure Appl. Log., 2012

2011

Topological aspects of the Medvedev lattice.

Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi

Arch. Math. Log., 2011

2010

The importance of Pi⁰₁ classes in effective randomness.

George Barmpalias, Andrew E. M. Lewis, Keng Meng Ng

J. Symb. Log., 2010

2009

The First Order Theories of the Medvedev and Muchnik Lattices.

Andrew E. M. Lewis, André Nies, Andrea Sorbi

Proceedings of the Mathematical Theory and Computational Practice, 2009

2008

Randomness, lowness and degrees.

George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova

J. Symb. Log., 2008

<i>I</i> classes, LR degrees and Turing degrees.

George Barmpalias, Andrew E. M. Lewis, Frank Stephan

Ann. Pure Appl. Log., 2008

2007

Randomness and the linear degrees of computability.

Andrew E. M. Lewis, George Barmpalias

Ann. Pure Appl. Log., 2007

Working with the <i>LR</i> Degrees.

George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova

Proceedings of the Theory and Applications of Models of Computation, 2007

A Weakly 2-Random Set That Is Not Generalized Low.

Andrew E. M. Lewis, Antonio Montalbán, André Nies

Proceedings of the Computation and Logic in the Real World, 2007

2006

The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees.

George Barmpalias, Andrew E. M. Lewis

Notre Dame J. Formal Log., 2006

A C.E. Real That Cannot Be SW-Computed by Any Ω Number.

George Barmpalias, Andrew E. M. Lewis

Notre Dame J. Formal Log., 2006

Random reals and Lipschitz continuity.

Andrew E. M. Lewis, George Barmpalias

Math. Struct. Comput. Sci., 2006

The ibT degrees of computably enumerable sets are not dense.

George Barmpalias, Andrew E. M. Lewis

Ann. Pure Appl. Log., 2006

The Jump Classes of Minimal Covers.

Andrew E. M. Lewis

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

The minimal complementation property above 0'.

Andrew E. M. Lewis

Math. Log. Q., 2005

Properly Sigma₂ minimal degrees and 0'' complementation.

S. Barry Cooper, Andrew E. M. Lewis, Yue Yang

Math. Log. Q., 2005

On a Question of Sacks - A Partial Solution on the Positive Side.

Andrew E. M. Lewis

Proceedings of the New Computational Paradigms, 2005

1991

Pi⁰₁-Classes and Rado's Selection Principle.

Carl G. Jockusch Jr., Andrew E. M. Lewis, Jeffrey B. Remmel

J. Symb. Log., 1991