|
 | Up a level |
Barmpalias, George and Lewis-Pye, Andrew (2019) Compression of data streams down to their information content. IEEE Transactions on Information Theory, 65 (7). pp. 4471-4485. ISSN 0018-9448
Barmpalias, George, Huang, Neng, Lewis-Pye, Andrew, Li, Angsheng, Li, Xuechen, Pan, Yicheng and Roughgarden, Tim (2019) The idemetric property: when most distances are (almost) the same. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 475 (2222). ISSN 1364-5021
Barmpalias, George, Elwes, Richard and Lewis-Pye, Andy (2018) Minority population in the one-dimensional Schelling model of segregation. Journal of Statistical Physics. ISSN 0022-4715
Barmpalias, George, Lewis-Pye, Andrew and Li, Angsheng (2018) Pointed computations and Martin-Löf randomnesss. Computability, 7 (2-3). pp. 171-177. ISSN 2211-3568
Barmpalias, George, Elwes, Richard and Lewis-Pye, Andrew (2018) Digital morphogenesis via Schelling segregation. Nonlinearity, 31 (4). 1593 - 1638. ISSN 0951-7715
Barmpalias, George and Lewis-Pye, Andrew (2017) Differences of halting probabilities. Journal of Computer and System Sciences, 89. pp. 349-360. ISSN 0022-0000
Barmpalias, George and Lewis-Pye, Andrew (2017) Optimal redundancy in computations from random oracles. Journal of Computer and System Sciences. ISSN 0022-0000
Barmpalias, George and Lewis-Pye, Andrew (2017) Computing halting probabilities from other halting probabilities. Theoretical Computer Science, 660. pp. 16-22. ISSN 0304-3975
Barmpalias, George, Fang, Nan and Lewis-Pye, Andrew (2016) Optimal asymptotic bounds on the oracle use in computations from Chaitin’s Omega. Journal of Computer and System Sciences, 82 (8). pp. 1283-1299. ISSN 0022-0000
Barmpalias, George, Lewis-Pye, Andrew and Teutsch, Jason (2016) Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. Information and Computation, 251. pp. 287-300. ISSN 0890-5401
Barmpalias, George, Elwes, Richard and Lewis-Pye, Andrew (2016) Unperturbed Schelling segregation in two or three dimensions. Journal of Statistical Physics, 164 (6). pp. 1460-1487. ISSN 0022-4715
Barmpalias, George, Elwes, Richard and Lewis-Pye, Andrew (2015) Tipping points in 1-dimensional Schelling models with switching agents. Journal of Statistical Physics, 158 (4). pp. 806-852. ISSN 0022-4715
Barmpalias, George, Day, Adam R. and Lewis-Pye, Andrew (2014) The typical Turing degree. Proceedings of the London Mathematical Society, 109 (1). pp. 1-39. ISSN 0024-6115
Barmpalias, George, Elwes, Richard and Lewis-Pye, Andrew (2014) Digital morphogenesis via Schelling segregation. Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium. pp. 156-165. ISSN 0272-5428
Barmpalias, George and Lewis-Pye, Andrew (2012) Measure and cupping in the Turing degrees. Proceedings of the American Mathematical Society, 140 (10). pp. 3607-3622. ISSN 0002-9939
Barmpalias, George and Lewis-Pye, Andrew (2011) Chaitin's halting probability and the compression of strings using oracles. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 467 (2134). pp. 2912-2926. ISSN 1364-5021
Barmpalias, George, Lewis-Pye, Andrew and Stephan, Frank (2008) Π10 classes, LR degrees and Turing degrees. Annals of Pure and Applied Logic, 156 (1). pp. 21-38. ISSN 0168-0072
Barmpalias, George, Lewis-Pye, Andrew and Soskova, Mariya (2008) Randomness, lowness and degrees. Journal of Symbolic Logic, 73 (2). pp. 559-577. ISSN 0022-4812
Lewis-Pye, Andrew and Barmpalias, George (2007) Randomness and the linear degrees of computability. Annals of Pure and Applied Logic, 145 (3). pp. 252-257. ISSN 0168-0072
Lewis-Pye, Andrew and Barmpalias, George (2006) Random reals and Lipschitz continuity. Mathematical Structures in Computer Science, 16 (5). pp. 737-749. ISSN 0960-1295
Barmpalias, George and Lewis-Pye, Andrew (2006) A c.e. real that cannot be sw-computed by any Ω number. Notre Dame Journal of Formal Logic, 47 (2). pp. 197-209. ISSN 0029-4527
Barmpalias, George and Lewis-Pye, Andrew (2006) The hypersimple-free c.e. wtt degrees are dense in the c.e. wtt degrees. Notre Dame Journal of Formal Logic, 47 (3). pp. 361-370. ISSN 0029-4527
Barmpalias, George and Lewis-Pye, Andrew (2006) The ibT degrees of computably enumerable sets are not dense. Annals of Pure and Applied Logic, 141 (1-2). pp. 51-60. ISSN 0168-0072
Barmpalias, George and Lewis-Pye, Andrew (2017) Limits of the Kucera-Gacs coding method. In: Post-proceedings volume of SEALS 2016 (South Eastern Logic Symposium). World Scientific (Firm).
Barmpalias, George and Lewis-Pye, Andrew (2017) A note on the differences of computably enumerable reals. In: Day, Adam, Fellows, Michael, Greenberg, Noam, Khoussainov, Bakhadyr, Melnikov, Alexander and Rosamond, Frances, (eds.) Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday. Lecture Notes in Computer Science. Springer International (Firm), Cham, Switzerland, pp. 623-632. ISBN 9783319500614
Barmpalias, George and Lewis-Pye, Andrew (2015) The information content of typical reals. In: Sommaruga, Giovanni and Strahm, Thomas, (eds.) Turing’s revolution: the impact of his ideas about computability. Springer Berlin / Heidelberg, pp. 207-224. ISBN 9783319221557
Barmpalias, George, Lewis-Pye, Andrew and Soskova, Mariya (2007) Working with the LR degrees. In: Cai, Jin-Yi, Cooper, S. Barry and Zhu, Hong, (eds.) Theory and Applications of Models of Computation: 4th International Conference, Tamc 2007, Shanghai, China, May 22-25, 2007. Lecture notes in computer science (4484). Springer Berlin / Heidelberg, Berlin, pp. 89-99. ISBN 9783540725039
