Andrew E. M. Lewis - Concepedia

Author

Andrew E. M. Lewis

Also Known As

A E Lewis, A. E. Lewis, A. E. M. Lewis, A.E. LEWIS, A.E. Lewis, T.L. Weinmann & N.M. Telang, A.E.M. Lewis, ANDREW E. M. LEWIS, Andrew E. Lewis, Andrew E. M. Lewis, Andrew E.M. Lewis

Publications

347

Citations

H-Index

Concepts

All Affiliations

University of Leeds University of Siena University of Aberdeen

About

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

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	8	8	156
2	Medicine	2	2	27
3	Language Studies	1	1	14
4	Public Health	1	1	13
5	Biology	1	1	13

Andrew E. M. Lewis

Publications

230

Citations

H-Index

Page 1

	Year	Citations
A fixed-point-free minimal degree Masahiro Kumabe, Andrew E. M. Lewis Journal of the London Mathematical Society Geometry Of NumberFixed-point-free Minimal DegreeComputational Complexity TheoryEngineeringProof Complexity	2009	32
Randomness, lowness and degrees George Barmpalias, Andrew E. M. Lewis, Mariya I. Soskova Journal of Symbolic Logic EngineeringComputational ComplexityMathematical StatisticProof ComplexityLr Degrees	2008	29
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 Mstyle Mathvariant=Math XmlnsEnumerable SetsDiscrete Mathematics	2005	24
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 Turing MachineEngineeringEntropyEffective RandomnessComputational Complexity	2010	19
Random reals and Lipschitz continuity Andrew E. M. Lewis, George Barmpalias Mathematical Structures in Computer Science Theory Of ComputingMeasure TheoryLipschitz ContinuityEngineeringIncompleteness	2006	17
Randomness and the linear degrees of computability Andrew E. M. Lewis, George Barmpalias Annals of Pure and Applied Logic EngineeringEntropyAlgorithmic Information TheoryComputational ComplexityProbability Theory	2006	16
A C.E. Real That Cannot Be SW-Computed by Any Ω Number George Barmpalias, Andrew E. M. Lewis Notre Dame Journal of Formal Logic Computational Complexity TheoryEngineeringRandom C.eComputability TheoryProof Complexity	2006	15
Π10 classes, strong minimal covers and hyperimmune-free degrees Andrew E. M. Lewis Bulletin of the London Mathematical Society Strong Minimal CoverImmunogeneticsImmunologyAutoimmunityπ10 Classes	2007	14
Diagonally Non-Computable Functions and Bi-Immunity Carl G. Jockusch, Andrew E. M. Lewis Journal of Symbolic Logic Theory Of ComputingNon-computable FunctionsSymmetric FunctionEngineeringComputability Theory	2013	14
Chaitin's halting probability and the compression of strings using oracles George Barmpalias, Andrew E. M. Lewis Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences EngineeringMembership RelationComputational ComplexityProbability ωCombinatorics On Word	2011	14

Page 1