| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | George Barmpalias |
Tracing and domination in the Turing degrees.  |
Ann. Pure Appl. Logic  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias |
On Strings with Trivial Kolmogorov Complexity. |
Int. J. Software and Informatics |
2011 |
DBLP BibTeX RDF |
|
| 1 | George Barmpalias, C. S. Vlek |
Kolmogorov complexity of initial segments of sequences and arithmetical definability. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias, T. F. Sterkenburg |
On the number of infinite sequences with trivial initial segment complexity. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias, Rod Downey, Keng Meng Ng |
Jump inversions inside effectively closed sets and applications to randomness. |
J. Symb. Log. |
2011 |
DBLP BibTeX RDF |
|
| 1 | George Barmpalias, André Nies |
Upper bounds on ideals in the computably enumerable Turing degrees. |
Ann. Pure Appl. Logic |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias |
Universal computably enumerable sets and initial segment prefix-free complexity |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | George Barmpalias, Angsheng Li |
Kolmogorov complexity and computably enumerable sets |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | George Barmpalias |
Relative Randomness and Cardinality. |
Notre Dame Journal of Formal Logic |
2010 |
DBLP BibTeX RDF |
|
| 1 | George Barmpalias, Andrew E. M. Lewis, Keng Meng Ng |
The importance of Pi01 classes in effective randomness. |
J. Symb. Log. |
2010 |
DBLP BibTeX RDF |
|
| 1 | George Barmpalias |
Elementary differences between the degrees of unsolvability and degrees of compressibility. |
Ann. Pure Appl. Logic |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias, Anthony Morphett |
Non-cupping, measure and computably enumerable splittings. |
Mathematical Structures in Computer Science |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber |
K-Triviality of Closed Sets and Continuous Functions. |
J. Log. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova |
Randomness, lowness and degrees. |
J. Symb. Log. |
2008 |
DBLP BibTeX RDF |
|
| 1 | George Barmpalias, Andrew E. M. Lewis, Frank Stephan |
I classes, LR degrees and Turing degrees. |
Ann. Pure Appl. Logic |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias, Paul Brodhead, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber |
Algorithmic randomness of continuous functions. |
Arch. Math. Log. |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 03D28, 68Q30, 60D05 |
| 1 | George Barmpalias, Antonio Montalbán |
A Cappable Almost Everywhere Dominating Computably Enumerable Degree. |
Electr. Notes Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias, Paul Brodhead, Douglas Cenzer, Seyyed Dashti, Rebecca Weber |
Algorithmic Randomness of Closed Sets. |
J. Log. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bahareh Afshari, George Barmpalias, S. Barry Cooper, Frank Stephan |
Post's Programme for the Ershov Hierarchy. |
J. Log. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew E. M. Lewis, George Barmpalias |
Randomness and the linear degrees of computability. |
Ann. Pure Appl. Logic |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova |
Working with the LR Degrees. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber |
K -Trivial Closed Sets and Continuous Functions. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Computability, Randomness, Classes |
| 1 | George Barmpalias |
Random non-cupping revisited. |
J. Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew E. M. Lewis, George Barmpalias |
Random reals and Lipschitz continuity. |
Mathematical Structures in Computer Science |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP BibTeX RDF |
|
| 1 | George Barmpalias, Andrew E. M. Lewis |
The ibT degrees of computably enumerable sets are not dense. |
Ann. Pure Appl. Logic |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Bahareh Afshari, George Barmpalias, S. Barry Cooper |
Immunity Properties and the n-C.E. Hierarchy. |
TAMC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Xizhong Zheng, Robert Rettinger, George Barmpalias |
h-monotonically computable real numbers. |
Math. Log. Q. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias |
Hypersimplicity and semicomputability in the weak truth table degrees. |
Arch. Math. Log. |
2005 |
DBLP DOI BibTeX RDF |
Hypersimple, Semicomputable, Weak Truth Table Degrees |
| 1 | George Barmpalias |
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees. |
CiE |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias |
Approximation representations for reals and their wtt-degrees. |
Math. Log. Q. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias |
Approximation Representations for ?2 Reals. |
Arch. Math. Log. |
2004 |
DBLP DOI BibTeX RDF |
2 reals, Approximation structure, Cuts of linear orderings, Representations |
| 1 | George Barmpalias |
A transfinite hierarchy of reals. |
Math. Log. Q. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias |
The approximation structure of a computably approximable real. |
J. Symb. Log. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Xizhong Zheng, George Barmpalias |
On the Monotonic Computability of Semi-computable Real Numbers. |
DMTCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias |
On 0'-computable Reals. |
Electr. Notes Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")