George Barmpalias Coauthor index pubzone.org

Facets and more with CompleteSearch

Listing of the DBLP Bibliography Server - FAQ
Other views (modern): by type - by year
Other mirrors: Trier II - Dagstuhl


Ask others: ACM DL/Guide - CiteSeerx - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2017
j45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Andrew Lewis-Pye: Computing halting probabilities from other halting probabilities. Theor. Comput. Sci. 660: 16-22 (2017)
j44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Douglas Cenzer, Christopher P. Porter: Random numbers as probabilities of machine behavior. Theor. Comput. Sci. 673: 1-18 (2017)
j43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Rodney G. Downey: Kobayashi compressibility. Theor. Comput. Sci. 675: 89-100 (2017)
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Andrew Lewis-Pye: A Note on the Differences of Computably Enumerable Reals. Computability and Complexity 2017: 623-632
2016
i16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Andrew Lewis-Pye, Nan Fang: Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega. CoRR abs/1602.03208 (2016)
i15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Andrew Lewis-Pye: Computing halting probabilities from other halting probabilities. CoRR abs/1602.06395 (2016)
i14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Andrew Lewis-Pye, Jason Teutsch: Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. CoRR abs/1602.07113 (2016)
i13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Andrew Lewis-Pye: Differences of halting probabilities. CoRR abs/1604.00216 (2016)
i12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Douglas A. Cenzer, Christopher P. Porter: Random numbers as probabilities of machine behaviour. CoRR abs/1605.05838 (2016)
i11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Andrew Lewis-Pye: Optimal redundancy in computations from random oracles. CoRR abs/1606.07910 (2016)
i10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Rodney G. Downey: Kobayashi compressibility. CoRR abs/1608.00692 (2016)
i9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Andrew Lewis-Pye, Angsheng Li: Pointed computations and Martin-Löf randomness. CoRR abs/1608.02081 (2016)
i8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Douglas Cenzer, Christopher P. Porter: The probability of a computable output from a random oracle. CoRR abs/1612.08537 (2016)
j42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Andrew Lewis-Pye, Jason Teutsch: Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. Inf. Comput. 251: 287-300 (2016)
j41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Nan Fang, Andrew Lewis-Pye: Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega. J. Comput. Syst. Sci. 82(8): 1283-1299 (2016)
2015
i7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Richard Elwes, Andy Lewis-Pye: From randomness to order: unperturbed Schelling segregation in two or three dimensions. CoRR abs/1504.03809 (2015)
i6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Rodney G. Downey, Michael McInerney: Integer Valued Betting strategies and Turing Degrees. CoRR abs/1505.05298 (2015)
i5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Richard Elwes, Andy Lewis-Pye: Minority population in the one-dimensional Schelling model of segregation. CoRR abs/1508.02497 (2015)
j40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Rodney G. Downey, Michael McInerney: Integer valued betting strategies and Turing degrees. J. Comput. Syst. Sci. 81(7): 1387-1412 (2015)
2014
j39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Rodney G. Downey: Exact Pairs for the Ideal of the k-Trivial Sequences in the Turing Degrees. J. Symb. Log. 79(3): 676-692 (2014)
j38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Manindra Agrawal, S. Barry Cooper: Theory and Applications of Models of Computation at the Turing Centenary in China. Theor. Comput. Sci. 560: 107 (2014)
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Richard Elwes, Andy Lewis-Pye: Digital Morphogenesis via Schelling Segregation. FOCS 2014: 156-165
2013
j37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Angsheng Li: Kolmogorov complexity and computably enumerable sets. Ann. Pure Appl. Logic 164(12): 1187-1200 (2013)
j36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias: Algorithmic randomness and measures of complexity. Bulletin of Symbolic Logic 19(3): 318-350 (2013)
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndy Lewis-Pye, George Barmpalias, Richard Elwes: Digital morphogenesis via Schelling segregation .CoRR abs/1302.4014 (2013)
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Richard Elwes, Andy Lewis-Pye: Tipping Points in Schelling Segregation. CoRR abs/1311.5934 (2013)
j35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias: Universal computably enumerable sets and initial segment prefix-free complexity. Inf. Comput. 233: 41-59 (2013)
j34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge 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)
j33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartijn Baartse, George Barmpalias: On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity. Theory Comput. Syst. 52(1): 28-47 (2013)
2012
j32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias: Tracing and domination in the Turing degrees. Ann. Pure Appl. Logic 163(5): 500-505 (2012)
j31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias: Compactness arguments with effectively closed sets for the study of relative randomness. J. Log. Comput. 22(4): 679-691 (2012)
j30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, André Nies: Low upper bounds in the Turing degrees revisited. J. Log. Comput. 22(4): 693-699 (2012)
2011
j29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, André Nies: Upper bounds on ideals in the computably enumerable Turing degrees. Ann. Pure Appl. Logic 162(6): 465-473 (2011)
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias: Universal computably enumerable sets and initial segment prefix-free complexity .CoRR abs/1110.1864 (2011)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Angsheng Li: Kolmogorov complexity and computably enumerable sets .CoRR abs/1111.4339 (2011)
j28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias: On Strings with Trivial Kolmogorov Complexity. Int. J. Software and Informatics 5(4): 579-593 (2011)
j27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Rod Downey, Keng Meng Ng: Jump inversions inside effectively closed sets and applications to randomness. J. Symb. Log. 76(2): 491-518 (2011)
j26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, C. S. Vlek: Kolmogorov complexity of initial segments of sequences and arithmetical definability. Theor. Comput. Sci. 412(41): 5656-5667 (2011)
j25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, T. F. Sterkenburg: On the number of infinite sequences with trivial initial segment complexity. Theor. Comput. Sci. 412(52): 7133-7146 (2011)
2010
j24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias: Elementary differences between the degrees of unsolvability and degrees of compressibility. Ann. Pure Appl. Logic 161(7): 923-934 (2010)
j23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Andrew E. M. Lewis, Keng Meng Ng: The importance of Pi01 classes in effective randomness. J. Symb. Log. 75(1): 387-400 (2010)
j22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias: Relative Randomness and Cardinality. Notre Dame Journal of Formal Logic 51(2): 195-205 (2010)
2009
j21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge 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)
j20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Anthony Morphett: Non-cupping, measure and computably enumerable splittings. Mathematical Structures in Computer Science 19(1): 25-43 (2009)
2008
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge 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)
j18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Andrew E. M. Lewis, Frank Stephan: I classes, LR degrees and Turing degrees. Ann. Pure Appl. Logic 156(1): 21-38 (2008)
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova: Randomness, lowness and degrees. J. Symb. Log. 73(2): 559-577 (2008)
2007
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew E. M. Lewis, George Barmpalias: Randomness and the linear degrees of computability. Ann. Pure Appl. Logic 145(3): 252-257 (2007)
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Antonio Montalbán: A Cappable Almost Everywhere Dominating Computably Enumerable Degree. Electr. Notes Theor. Comput. Sci. 167: 17-31 (2007)
j14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBahareh Afshari, George Barmpalias, S. Barry Cooper, Frank Stephan: Post's Programme for the Ershov Hierarchy. J. Log. Comput. 17(6): 1025-1040 (2007)
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Paul Brodhead, Douglas Cenzer, Seyyed Dashti, Rebecca Weber: Algorithmic Randomness of Closed Sets. J. Log. Comput. 17(6): 1041-1062 (2007)
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber: K -Trivial Closed Sets and Continuous Functions. CiE 2007: 135-145
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova: Working with the LR Degrees. TAMC 2007: 89-99
2006
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge 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)
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias: Random non-cupping revisited. J. Complexity 22(6): 850-857 (2006)
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew E. M. Lewis, George Barmpalias: Random reals and Lipschitz continuity. Mathematical Structures in Computer Science 16(5): 737-749 (2006)
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias, Andrew E. M. Lewis: A C.E. Real That Cannot Be SW-Computed by Any Ω Number. Notre Dame Journal of Formal Logic 47(2): 197-209 (2006)
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge 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)
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBahareh Afshari, George Barmpalias, S. Barry Cooper: Immunity Properties and the n-C.E. Hierarchy. TAMC 2006: 694-703
2005
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias: Hypersimplicity and semicomputability in the weak truth table degrees. Arch. Math. Log. 44(8): 1045-1065 (2005)
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLXizhong Zheng, Robert Rettinger, George Barmpalias: h-monotonically computable real numbers. Math. Log. Q. 51(2): 157-170 (2005)
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias: Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees. CiE 2005: 8-17
2004
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias: Approximation Representations for ?2 Reals. Arch. Math. Log. 43(8): 947-964 (2004)
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias: Approximation representations for reals and their wtt-degrees. Math. Log. Q. 50(4-5): 370-380 (2004)
2003
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias: The approximation structure of a computably approximable real. J. Symb. Log. 68(3): 885-922 (2003)
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias: A transfinite hierarchy of reals. Math. Log. Q. 49(2): 163-172 (2003)
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLXizhong Zheng, George Barmpalias: On the Monotonic Computability of Semi-computable Real Numbers. DMTCS 2003: 290-300
2002
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Barmpalias: On 0'-computable Reals. Electr. Notes Theor. Comput. Sci. 66(1): 1-12 (2002)

Coauthor Index

1Bahareh Afshari[j14] [c3]
2Manindra Agrawal[j38]
3Martijn Baartse[j33]
4Paul Brodhead[j19] [j13]
5Douglas A. Cenzer
Douglas Cenzer
[j44] [i12] [i8] [j21] [j19] [j13] [c5]
6S. Barry Cooper[j38] [j14] [c3]
7Seyyed Dashti[j13]
8Rodney G. Downey
Rod Downey
[j43] [i10] [i6] [j40] [j39] [j27]
9Richard Elwes[i7] [i5] [c6] [i4] [i3]
10Nan Fang[i16] [j41]
11Rupert Hölzl[j34]
12Andrew E. M. Lewis[j34] [j23] [j18] [j17] [j16] [c4] [j12] [j10] [j9] [j8]
13Andy Lewis-Pye
Andrew Lewis-Pye
[j45] [c7] [i16] [i15] [i14] [i13] [i11] [i9] [j42] [j41] [i7] [i5] [c6] [i4] [i3]
14Angsheng Li[i9] [j37] [i1]
15Michael McInerney[i6] [j40]
16Wolfgang Merkle[j34]
17Antonio Montalbán[j15]
18Anthony Morphett[j20]
19Keng Meng Ng[j27] [j23]
20André Nies[j30] [j29]
21Christopher P. Porter[j44] [i12] [i8]
22Jeffrey B. Remmel[j21] [j19] [c5]
23Robert Rettinger[j6]
24Mariya Ivanova Soskova[j17] [c4]
25Frank Stephan 0001[j18] [j14]
26T. F. Sterkenburg[j25]
27Jason Teutsch[i14] [j42]
28C. S. Vlek[j26]
29Rebecca Weber[j21] [j19] [j13] [c5]
30Xizhong Zheng[j6] [c1]

 

Last update 2017-06-17 01:00 CEST by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page