George Barmpalias

95 papers A* 1C 5Journal 87Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Collision-resistant hash-shuffles on the reals. Inf. Comput. George Barmpalias, Xiaoyan Zhang
2026	J	`jnl`	Speedability of computably approximable reals and their approximations. CoRR George Barmpalias, Nan Fang, Wolfgang Merkle, Ivan Titov
2025	J	`jnl`	Collision-resistant hash-shuffles on the reals. CoRR George Barmpalias, Xiaoyan Zhang
2025	J	`jnl`	Complexity of inversion of functions on the reals. Math. Struct. Comput. Sci. George Barmpalias, Mingyang Wang, Xiaoyan Zhang
2025	J	`jnl`	Computable one-way functions on the reals. Inf. Comput. George Barmpalias, Xiaoyan Zhang
2024	J	`jnl`	Complexity of inversion of functions on the reals. CoRR George Barmpalias, Mingyang Wang, Xiaoyan Zhang
2024	J	`jnl`	Computable one-way functions on the reals. CoRR George Barmpalias, Xiaoyan Zhang
2024	J	`jnl`	Dimensionality and randomness. CoRR George Barmpalias, Xiaoyan Zhang
2024	J	`jnl`	Growth and irreducibility in path-incompressible trees. Inf. Comput. George Barmpalias, Xiaoyan Zhang
2024	J	`jnl`	Pathwise-randomness and models of second-order arithmetic. Inf. Comput. George Barmpalias, Wei Wang
2023	J	`jnl`	Compression of enumerations and gain. CoRR George Barmpalias, Xiaoyan Zhang, Bohua Zhan
2023	J	`jnl`	Randomness below complete theories of arithmetic. Inf. Comput. George Barmpalias, Wei Wang
2023	J	`jnl`	The Kučera-Gács theorem revisited by Levin. Theor. Comput. Sci. George Barmpalias, Alexander Shen
2022	J	`jnl`	Aspects of Muchnik's paradox in restricted betting. CoRR George Barmpalias, Lu Liu
2022	J	`jnl`	Growth and irreducibility in path-incompressible trees. CoRR George Barmpalias, Wei Wang
2020	J	`jnl`	Granularity of wagers in games and the possibility of saving. Inf. Comput. George Barmpalias, Nan Fang
2020	J	`jnl`	Monotonous betting strategies in warped casinos. Inf. Comput. George Barmpalias, Nan Fang, Andrew Lewis-Pye
2019	J	`jnl`	Compression of Data Streams Down to Their Information Content. IEEE Trans. Inf. Theory George Barmpalias, Andrew Lewis-Pye
2018	J	`jnl`	Equivalences between learning of data and probability distributions, and their applications. CoRR George Barmpalias, Nan Fang, Frank Stephan
2018	J	`jnl`	Equivalences between learning of data and probability distributions, and their applications. Inf. Comput. George Barmpalias, Nan Fang, Frank Stephan
2018	J	`jnl`	Granularity of wagers in games and the (im)possibility of savings. CoRR George Barmpalias, Nan Fang
2018	J	`jnl`	Monotonous betting strategies in warped casinos. CoRR George Barmpalias, Nan Fang, Andrew Lewis-Pye
2018	J	`jnl`	Optimal redundancy in computations from random oracles. J. Comput. Syst. Sci. George Barmpalias, Andrew Lewis-Pye
2018	J	`jnl`	Pointed computations and Martin-Löf randomness. Comput. George Barmpalias, Andrew Lewis-Pye, Angsheng Li
2018	J	`jnl`	The idemetric property: when most distances are (almost) the same. CoRR George Barmpalias, Neng Huang, Andrew Lewis-Pye, Angsheng Li, Xuechen Li, Yicheng Pan, Tim Roughgarden
2017	—	`conf`	A Note on the Differences of Computably Enumerable Reals. Computability and Complexity George Barmpalias, Andrew Lewis-Pye
2017	J	`jnl`	Algorithmic learning of probability distributions from random data in the limit. CoRR George Barmpalias, Frank Stephan
2017	J	`jnl`	Aspects of Chaitin's Omega. CoRR George Barmpalias
2017	J	`jnl`	Compression of data streams down to their information content. CoRR George Barmpalias, Andrew Lewis-Pye
2017	J	`jnl`	Computing halting probabilities from other halting probabilities. Theor. Comput. Sci. George Barmpalias, Andrew Lewis-Pye
2017	J	`jnl`	Differences of halting probabilities. J. Comput. Syst. Sci. George Barmpalias, Andrew Lewis-Pye
2017	J	`jnl`	Kobayashi compressibility. Theor. Comput. Sci. George Barmpalias, Rodney G. Downey
2017	J	`jnl`	Random numbers as probabilities of machine behavior. Theor. Comput. Sci. George Barmpalias, Douglas Cenzer, Christopher P. Porter
2017	J	`jnl`	The Probability of a Computable Output from a Random Oracle. ACM Trans. Comput. Log. George Barmpalias, Douglas Cenzer, Christopher P. Porter
2016	J	`jnl`	Computing halting probabilities from other halting probabilities. CoRR George Barmpalias, Andrew Lewis-Pye
2016	J	`jnl`	Differences of halting probabilities. CoRR George Barmpalias, Andrew Lewis-Pye
2016	J	`jnl`	Kobayashi compressibility. CoRR George Barmpalias, Rodney G. Downey
2016	J	`jnl`	Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. CoRR George Barmpalias, Andrew Lewis-Pye, Jason Teutsch
2016	J	`jnl`	Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. Inf. Comput. George Barmpalias, Andrew Lewis-Pye, Jason Teutsch
2016	J	`jnl`	Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega. CoRR George Barmpalias, Andrew Lewis-Pye, Nan Fang
2016	J	`jnl`	Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega. J. Comput. Syst. Sci. George Barmpalias, Nan Fang, Andrew Lewis-Pye
2016	J	`jnl`	Optimal redundancy in computations from random oracles. CoRR George Barmpalias, Andrew Lewis-Pye
2016	J	`jnl`	Pointed computations and Martin-Löf randomness. CoRR George Barmpalias, Andrew Lewis-Pye, Angsheng Li
2016	J	`jnl`	Random numbers as probabilities of machine behaviour. CoRR George Barmpalias, Douglas A. Cenzer, Christopher P. Porter
2016	J	`jnl`	The probability of a computable output from a random oracle. CoRR George Barmpalias, Douglas Cenzer, Christopher P. Porter
2015	J	`jnl`	From randomness to order: unperturbed Schelling segregation in two or three dimensions. CoRR George Barmpalias, Richard Elwes, Andy Lewis-Pye
2015	J	`jnl`	Integer Valued Betting strategies and Turing Degrees. CoRR George Barmpalias, Rodney G. Downey, Michael McInerney
2015	J	`jnl`	Integer valued betting strategies and Turing degrees. J. Comput. Syst. Sci. George Barmpalias, Rodney G. Downey, Michael McInerney
2015	J	`jnl`	Minority population in the one-dimensional Schelling model of segregation. CoRR George Barmpalias, Richard Elwes, Andy Lewis-Pye
2015	J	`jnl`	On the existence of a strong minimal pair. J. Math. Log. George Barmpalias, Mingzhong Cai, Steffen Lempp, Theodore A. Slaman
2014	A*	`conf`	Digital Morphogenesis via Schelling Segregation. FOCS George Barmpalias, Richard Elwes, Andy Lewis-Pye
2014	J	`jnl`	Exact Pairs for the Ideal of the J. Symb. Log. George Barmpalias, Rodney G. Downey
2014	J	`jnl`	Theory and Applications of Models of Computation at the Turing Centenary in China. Theor. Comput. Sci. George Barmpalias, Manindra Agrawal, S. Barry Cooper
2013	J	`jnl`	Algorithmic randomness and measures of complexity. Bull. Symb. Log. George Barmpalias
2013	J	`jnl`	Analogues of Chaitin's Omega in the computably enumerable sets. Inf. Process. Lett. George Barmpalias, Rupert Hölzl, Andrew E. M. Lewis, Wolfgang Merkle
2013	J	`jnl`	Digital morphogenesis via Schelling segregation CoRR Andy Lewis-Pye, George Barmpalias, Richard Elwes
2013	J	`jnl`	Kolmogorov complexity and computably enumerable sets. Ann. Pure Appl. Log. George Barmpalias, Angsheng Li
2013	J	`jnl`	On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity. Theory Comput. Syst. Martijn Baartse, George Barmpalias
2013	J	`jnl`	Tipping Points in Schelling Segregation. CoRR George Barmpalias, Richard Elwes, Andy Lewis-Pye
2013	J	`jnl`	Universal computably enumerable sets and initial segment prefix-free complexity. Inf. Comput. George Barmpalias
2012	J	`jnl`	Compactness arguments with effectively closed sets for the study of relative randomness. J. Log. Comput. George Barmpalias
2012	J	`jnl`	Low upper bounds in the Turing degrees revisited. J. Log. Comput. George Barmpalias, André Nies
2012	J	`jnl`	Tracing and domination in the Turing degrees. Ann. Pure Appl. Log. George Barmpalias
2011	J	`jnl`	Jump inversions inside effectively closed sets and applications to randomness. J. Symb. Log. George Barmpalias, Rod Downey, Keng Meng Ng
2011	J	`jnl`	Kolmogorov complexity and computably enumerable sets CoRR George Barmpalias, Angsheng Li
2011	J	`jnl`	Kolmogorov complexity of initial segments of sequences and arithmetical definability. Theor. Comput. Sci. George Barmpalias, C. S. Vlek
2011	J	`jnl`	On Strings with Trivial Kolmogorov Complexity. Int. J. Softw. Informatics George Barmpalias
2011	J	`jnl`	On the number of infinite sequences with trivial initial segment complexity. Theor. Comput. Sci. George Barmpalias, Tom F. Sterkenburg
2011	J	`jnl`	Universal computably enumerable sets and initial segment prefix-free complexity CoRR George Barmpalias
2011	J	`jnl`	Upper bounds on ideals in the computably enumerable Turing degrees. Ann. Pure Appl. Log. George Barmpalias, André Nies
2010	J	`jnl`	Elementary differences between the degrees of unsolvability and degrees of compressibility. Ann. Pure Appl. Log. George Barmpalias
2010	J	`jnl`	Relative Randomness and Cardinality. Notre Dame J. Formal Log. George Barmpalias
2010	J	`jnl`	The importance of Pi J. Symb. Log. George Barmpalias, Andrew E. M. Lewis, Keng Meng Ng
2009	J	`jnl`	Non-cupping, measure and computably enumerable splittings. Math. Struct. Comput. Sci. George Barmpalias, Anthony Morphett
2008	J	`jnl`	Algorithmic randomness of continuous functions. Arch. Math. Log. George Barmpalias, Paul Brodhead, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber
2008	J	`jnl`	Randomness, lowness and degrees. J. Symb. Log. George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova
2007	J	`jnl`	Algorithmic Randomness of Closed Sets. J. Log. Comput. George Barmpalias, Paul Brodhead, Douglas Cenzer, Seyyed Dashti, Rebecca Weber
2007	J	`jnl`	Post's Programme for the Ershov Hierarchy. J. Log. Comput. Bahareh Afshari, George Barmpalias, S. Barry Cooper, Frank Stephan
2007	J	`jnl`	Randomness and the linear degrees of computability. Ann. Pure Appl. Log. Andrew E. M. Lewis, George Barmpalias
2007	C	`conf`	Working with the TAMC George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova
2006	J	`jnl`	A C.E. Real That Cannot Be SW-Computed by Any Ω Number. Notre Dame J. Formal Log. George Barmpalias, Andrew E. M. Lewis
2006	C	`conf`	A Cappable Almost Everywhere Dominating Computably Enumerable Degree. CCA George Barmpalias, Antonio Montalbán
2006	C	`conf`	Immunity Properties and the TAMC Bahareh Afshari, George Barmpalias, S. Barry Cooper
2006	J	`jnl`	Random non-cupping revisited. J. Complex. George Barmpalias
2006	J	`jnl`	Random reals and Lipschitz continuity. Math. Struct. Comput. Sci. Andrew E. M. Lewis, George Barmpalias
2006	J	`jnl`	The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees. Notre Dame J. Formal Log. George Barmpalias, Andrew E. M. Lewis
2006	J	`jnl`	The ibT degrees of computably enumerable sets are not dense. Ann. Pure Appl. Log. George Barmpalias, Andrew E. M. Lewis
2005	C	`conf`	Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees. CiE George Barmpalias
2005	J	`jnl`	Hypersimplicity and semicomputability in the weak truth table degrees. Arch. Math. Log. George Barmpalias
2004	J	`jnl`	Approximation Representations for ? Arch. Math. Log. George Barmpalias
2004	J	`jnl`	Approximation representations for reals and their wtt-degrees. Math. Log. Q. George Barmpalias
2003	J	`jnl`	A transfinite hierarchy of reals. Math. Log. Q. George Barmpalias
2003	—	`conf`	On the Monotonic Computability of Semi-computable Real Numbers. DMTCS Xizhong Zheng, George Barmpalias
2003	J	`jnl`	The approximation structure of a computably approximable real. J. Symb. Log. George Barmpalias
2002	C	`conf`	On 0'-computable Reals. CCA George Barmpalias