Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
George Barmpalias
2010 – today
- 2013
[j34]George Barmpalias, Rupert Hölzl, Andrew E. M. Lewis, Wolfgang Merkle: Analogues of Chaitin's Omega in the computably enumerable sets. Inf. Process. Lett. 113(5-6): 171-178 (2013)- [j33]Martijn Baartse, George Barmpalias: On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity. Theory Comput. Syst. 52(1): 28-47 (2013)
- [i3]Andy Lewis-Pye, George Barmpalias, Richard Elwes: Digital morphogenesis via Schelling segregation. CoRR abs/1302.4014 (2013)
- 2012
- [j32]George Barmpalias: Tracing and domination in the Turing degrees. Ann. Pure Appl. Logic 163(5): 500-505 (2012)
- [j31]George Barmpalias: Compactness arguments with effectively closed sets for the study of relative randomness. J. Log. Comput. 22(4): 679-691 (2012)
- [j30]George Barmpalias, André Nies: Low upper bounds in the Turing degrees revisited. J. Log. Comput. 22(4): 693-699 (2012)
- 2011
- [j29]George Barmpalias, André Nies: Upper bounds on ideals in the computably enumerable Turing degrees. Ann. Pure Appl. Logic 162(6): 465-473 (2011)
- [j28]George Barmpalias: On Strings with Trivial Kolmogorov Complexity. Int. J. Software and Informatics 5(4): 579-593 (2011)
- [j27]George Barmpalias, Rod Downey, Keng Meng Ng: Jump inversions inside effectively closed sets and applications to randomness. J. Symb. Log. 76(2): 491-518 (2011)
- [j26]George Barmpalias, C. S. Vlek: Kolmogorov complexity of initial segments of sequences and arithmetical definability. Theor. Comput. Sci. 412(41): 5656-5667 (2011)
- [j25]George Barmpalias, T. F. Sterkenburg: On the number of infinite sequences with trivial initial segment complexity. Theor. Comput. Sci. 412(52): 7133-7146 (2011)
- [i2]George Barmpalias: Universal computably enumerable sets and initial segment prefix-free complexity. CoRR abs/1110.1864 (2011)
- [i1]George Barmpalias, Angsheng Li: Kolmogorov complexity and computably enumerable sets. CoRR abs/1111.4339 (2011)
- 2010
- [j24]George Barmpalias: Elementary differences between the degrees of unsolvability and degrees of compressibility. Ann. Pure Appl. Logic 161(7): 923-934 (2010)
- [j23]George Barmpalias, Andrew E. M. Lewis, Keng Meng Ng: The importance of Pi01 classes in effective randomness. J. Symb. Log. 75(1): 387-400 (2010)
- [j22]George Barmpalias: Relative Randomness and Cardinality. Notre Dame Journal of Formal Logic 51(2): 195-205 (2010)
2000 – 2009
- 2009
- [j21]George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber: K-Triviality of Closed Sets and Continuous Functions. J. Log. Comput. 19(1): 3-16 (2009)
- [j20]George Barmpalias, Anthony Morphett: Non-cupping, measure and computably enumerable splittings. Mathematical Structures in Computer Science 19(1): 25-43 (2009)
- 2008
- [j19]George Barmpalias, Paul Brodhead, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber: Algorithmic randomness of continuous functions. Arch. Math. Log. 46(7-8): 533-546 (2008)
- [j18]George Barmpalias, Andrew E. M. Lewis, Frank Stephan: I classes, LR degrees and Turing degrees. Ann. Pure Appl. Logic 156(1): 21-38 (2008)
- [j17]George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova: Randomness, lowness and degrees. J. Symb. Log. 73(2): 559-577 (2008)
- 2007
- [j16]Andrew E. M. Lewis, George Barmpalias: Randomness and the linear degrees of computability. Ann. Pure Appl. Logic 145(3): 252-257 (2007)
- [j15]George Barmpalias, Antonio Montalbán: A Cappable Almost Everywhere Dominating Computably Enumerable Degree. Electr. Notes Theor. Comput. Sci. 167: 17-31 (2007)
- [j14]Bahareh Afshari, George Barmpalias, S. Barry Cooper, Frank Stephan: Post's Programme for the Ershov Hierarchy. J. Log. Comput. 17(6): 1025-1040 (2007)
- [j13]George Barmpalias, Paul Brodhead, Douglas Cenzer, Seyyed Dashti, Rebecca Weber: Algorithmic Randomness of Closed Sets. J. Log. Comput. 17(6): 1041-1062 (2007)
- [c5]George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber: K -Trivial Closed Sets and Continuous Functions. CiE 2007: 135-145
- [c4]George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova: Working with the LR Degrees. TAMC 2007: 89-99
- 2006
- [j12]George Barmpalias, Andrew E. M. Lewis: The ibT degrees of computably enumerable sets are not dense. Ann. Pure Appl. Logic 141(1-2): 51-60 (2006)
- [j11]
- [j10]Andrew E. M. Lewis, George Barmpalias: Random reals and Lipschitz continuity. Mathematical Structures in Computer Science 16(5): 737-749 (2006)
- [j9]George Barmpalias, Andrew E. M. Lewis: A C.E. Real That Cannot Be SW-Computed by Any Omega Number. Notre Dame Journal of Formal Logic 47(2): 197-209 (2006)
- [j8]George Barmpalias, Andrew E. M. Lewis: The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees. Notre Dame Journal of Formal Logic 47(3): 361-370 (2006)
- [c3]Bahareh Afshari, George Barmpalias, S. Barry Cooper: Immunity Properties and the n-C.E. Hierarchy. TAMC 2006: 694-703
- 2005
- [j7]George Barmpalias: Hypersimplicity and semicomputability in the weak truth table degrees. Arch. Math. Log. 44(8): 1045-1065 (2005)
- [j6]Xizhong Zheng, Robert Rettinger, George Barmpalias: h-monotonically computable real numbers. Math. Log. Q. 51(2): 157-170 (2005)
- [c2]George Barmpalias: Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees. CiE 2005: 8-17
- 2004
- [j5]George Barmpalias: Approximation Representations for ?2 Reals. Arch. Math. Log. 43(8): 947-964 (2004)
- [j4]George Barmpalias: Approximation representations for reals and their wtt-degrees. Math. Log. Q. 50(4-5): 370-380 (2004)
- 2003
- [j3]George Barmpalias: The approximation structure of a computably approximable real. J. Symb. Log. 68(3): 885-922 (2003)
- [j2]
- [c1]Xizhong Zheng, George Barmpalias: On the Monotonic Computability of Semi-computable Real Numbers. DMTCS 2003: 290-300
- 2002
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-03-02 19:28 CET by the dblp team