Items where Author is "Lewis-Pye, Andrew"

Number of items: 70.
  • The economic limits of permissionless consensus. (2024) Budish, Eric and Lewis-Pye, Andrew and Roughgarden, Tim picture_as_pdf
  • How does blockchain security dictate blockchain implementation? (2021) Lewis-Pye, Andrew and Roughgarden, Tim picture_as_pdf
  • Π10 classes, LR degrees and Turing degrees. Barmpalias, George and Lewis-Pye, Andrew and Stephan, Frank
  • Π10 classes, strong minimal covers and hyperimmune-free degrees. Lewis-Pye, Andrew
  • 5 minutes with Andre Nies. Lewis-Pye, Andrew
  • 5 minutes with Frank Wilczek. Lewis-Pye, Andrew
  • 5 minutes with Maura Paterson. Lewis-Pye, Andrew
  • 5 minutes with Yannai A. Gonczarowski. Lewis-Pye, Andrew
  • Analogues of Chaitinʼs Omega in the computably enumerable sets. Barmpalias, G. and Hölzl, R. and Lewis-Pye, Andrew and Merkle, W.
  • Andy Lewis-Pye: the strange patterns of segregation. Lewis-Pye, Andrew
  • Byzantine generals in the permissionless setting. Lewis-Pye, Andrew and Roughgarden, Tim picture_as_pdf
  • Chaitin's halting probability and the compression of strings using oracles. Barmpalias, George and Lewis-Pye, Andrew
  • Compression of data streams down to their information content. Barmpalias, George and Lewis-Pye, Andrew picture_as_pdf
  • Computably enumerable Turing degrees and the meet property. Durrant, Benedict and Lewis-Pye, Andrew and Meng Ng, Keng and Riley, James
  • Computing halting probabilities from other halting probabilities. Barmpalias, George and Lewis-Pye, Andrew
  • Cryptocurrencies:protocols for consensus. Lewis-Pye, Andrew picture_as_pdf
  • Cryptocurrencies:protocols for consensus. Lewis-Pye, Andrew picture_as_pdf
  • Diagonally non-computable functions and bi-immunity. Jockush, Carl G. and Lewis-Pye, Andrew
  • Differences of halting probabilities. Barmpalias, George and Lewis-Pye, Andrew
  • Digital morphogenesis via Schelling segregation. Barmpalias, George and Elwes, Richard and Lewis-Pye, Andrew
  • Digital morphogenesis via Schelling segregation. Barmpalias, George and Elwes, Richard and Lewis-Pye, Andrew
  • Empty intervals in the enumeration degrees. Kent, Thomas F. and Lewis-Pye, Andrew and Sorbi, Andrea
  • Establishing social cooperation: the role of hubs and community structure. Cooper, Barry and Lewis-Pye, Andrew and Li, Angsheng and Pan, Yicheng and Yong, Xi
  • Fever:optimal responsive view synchronisation. Lewis-Pye, Andrew and Abraham, Ittai picture_as_pdf
  • Finite cupping sets. Lewis-Pye, Andrew
  • Frosty:bringing strong liveness guarantees to the Snow family of consensus protocols. Buchwald, Aaron and Buttolph, Stephen and Lewis-Pye, Andrew and O'Grady, Patrick and Sekniqi, Kevin picture_as_pdf
  • Joining up to the generalized high degrees. Ellison, Philip and Lewis-Pye, Andrew
  • Limits of the Kucera-Gacs coding method. Barmpalias, George and Lewis-Pye, Andrew picture_as_pdf
  • Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. Barmpalias, George and Lewis-Pye, Andrew and Teutsch, Jason
  • Lumiere:making optimal BFT for partial synchrony practica. Lewis-Pye, Andrew and Malkhi, Dahlia and Naor, Oded and Nayak, Kartik picture_as_pdf
  • Measure and cupping in the Turing degrees. Barmpalias, George and Lewis-Pye, Andrew
  • Minimal complements for degrees below 0'. Lewis-Pye, Andrew
  • Monotonous betting strategies in warped casinos. Barmapalias, George and Fang, Nan and Lewis-Pye, Andrew picture_as_pdf
  • On a question of Slaman and Groszek. Lewis-Pye, Andrew
  • On a question of sacks: a partial solution on the positive side. Lewis-Pye, Andrew
  • On the degree spectrum of a π01 class. Downey, Rod and Greenberg, Noam and Lewis-Pye, Andrew and Montalbán, Antonio
  • On the degree spectrum of a π01 class. Kent, Thomas and Lewis-Pye, Andrew
  • Optimal asymptotic bounds on the oracle use in computations from Chaitin’s Omega. Barmpalias, George and Fang, Nan and Lewis-Pye, Andrew
  • Optimal redundancy in computations from random oracles. Barmpalias, George and Lewis-Pye, Andrew
  • Pointed computations and Martin-Löf randomnesss. Barmpalias, George and Lewis-Pye, Andrew and Li, Angsheng
  • Properly Σ2 minimal degrees and 0″ complementation. Cooper, S. Barry and Lewis-Pye, Andrew and Yang, Yue
  • Properties of the jump classes. Lewis-Pye, Andrew
  • Random reals and Lipschitz continuity. Lewis-Pye, Andrew and Barmpalias, George
  • Randomness and the linear degrees of computability. Lewis-Pye, Andrew and Barmpalias, George
  • Randomness, lowness and degrees. Barmpalias, George and Lewis-Pye, Andrew and Soskova, Mariya
  • Schelling segregation. Lewis-Pye, Andrew
  • Sex versus asex: an analysis of the role of variance conversion. Lewis-Pye, Andrew and Montalbán, Antonio
  • Strong minimal covers and a question of Yates: the story so far. Lewis-Pye, Andrew
  • Tipping points in 1-dimensional Schelling models with switching agents. Barmpalias, George and Elwes, Richard and Lewis-Pye, Andrew
  • Topological aspects of the Medvedev lattice. Lewis-Pye, Andrew and Shore, Richard A. and Sorbi, Andrea
  • Unperturbed Schelling segregation in two or three dimensions. Barmpalias, George and Elwes, Richard and Lewis-Pye, Andrew
  • Working with the LR degrees. Barmpalias, George and Lewis-Pye, Andrew and Soskova, Mariya
  • A c.e. real that cannot be sw-computed by any Ω number. Barmpalias, George and Lewis-Pye, Andrew
  • The complexity of computable categoricity. Downey, Rodney G. and Kach, Asher M. and Lempp, Steffen and Lewis-Pye, Andrew and Montalbán, Antonio and Turetsky, Daniel D.
  • The first order theories of the Medvedev and Muchnik lattices. Lewis-Pye, Andrew and Nies, André and Sorbi, Andrea
  • A fixed-point-free minimal degree. Kumabe, Masahiro and Lewis-Pye, Andrew
  • The hypersimple-free c.e. wtt degrees are dense in the c.e. wtt degrees. Barmpalias, George and Lewis-Pye, Andrew
  • The ibT degrees of computably enumerable sets are not dense. Barmpalias, George and Lewis-Pye, Andrew
  • The idemetric property:when most distances are (almost) the same. Barmpalias, George and Huang, Neng and Lewis-Pye, Andrew and Li, Angsheng and Li, Xuechen and Pan, Yicheng and Roughgarden, Tim picture_as_pdf
  • The importance of π⁰₁ classes in effective randomness. Barmapalias, George and Lewis-Pye, Andrew and Meng Ng, Keng
  • The information content of typical reals. Barmpalias, George and Lewis-Pye, Andrew
  • The jump classes of minimal covers. Lewis-Pye, Andrew
  • The minimal complementation property above 0′. Lewis-Pye, Andrew
  • A note on the differences of computably enumerable reals. Barmpalias, George and Lewis-Pye, Andrew
  • A note on the join property. Lewis-Pye, Andrew
  • A random degree with strong minimal cover. Lewis-Pye, Andrew
  • The search for natural definability in the Turing degrees. Lewis-Pye, Andrew
  • A single minimal complement for the c.e. degrees. Lewis-Pye, Andrew
  • The typical Turing degree. Barmpalias, George and Day, Adam R. and Lewis-Pye, Andrew
  • A weakly 2-random set that is not generalized low. Lewis-Pye, Andrew and Montalbán, Antonio and Nies, André