Concepedia

Andrew E. M. Lewis

AE

13

Publications

230

Citations

12

H-Index

1985

Active since

Affiliations

University of Leeds(Current)

University of Siena

University of Aberdeen

Andrew E. M. Lewis is an author at University of Leeds specializing in computer science, engineering, and computational complexity.

Top concepts

EngineeringComputer ScienceComputational ComplexityProbabilityTheory Of ComputingEntropyProof ComplexityDiscrete MathematicsMedicineStatistics

Publications per year

1985–2013

13

Publications

13

A fixed-point-free minimal degree

Masahiro Kumabe, Andrew E. M. Lewis · Journal of the London Mathematical Society · 2009 · 32 citations

Geometry Of Number, Fixed-point-free Minimal Degree, Computational Complexity Theory +10

Randomness, lowness and degrees

George Barmpalias, Andrew E. M. Lewis, Mariya I. Soskova · Journal of Symbolic Logic · 2008 · 29 citations

Engineering, Computational Complexity, Mathematical Statistic +17

The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mstyle mathvariant="italic"><mml:mi>ibT</mml:mi></mml:mstyle></mml:math> degrees of computably enumerable sets are not dense

George Barmpalias, Andrew E. M. Lewis · Annals of Pure and Applied Logic · 2005 · 24 citations

Mstyle Mathvariant=, Math Xmlns, Enumerable Sets +1

The importance of Π<sub>1</sub><sup>0</sup> classes in effective randomness

George Barmpalias, Andrew E. M. Lewis, Keng Meng Ng · Journal of Symbolic Logic · 2010 · 19 citations

Turing Machine, Engineering, Entropy +12

Random reals and Lipschitz continuity

Andrew E. M. Lewis, George Barmpalias · Mathematical Structures in Computer Science · 2006 · 17 citations

Theory Of Computing, Measure Theory, Lipschitz Continuity +12

Rows per page

1–5 of 13