| Publication | Date of Publication | Type |
|---|
| A scalable verification solution for blockchains | 2025-02-03 | Paper |
| How to verify computations with a rational network | 2025-02-03 | Paper |
Enumerations including laconic enumerators
Theoretical Computer Science | 2017-10-17 | Paper |
Closed left-r.e. sets
Computability | 2017-02-23 | Paper |
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers
Information and Computation | 2016-11-18 | Paper |
On approximate decidability of minimal programs
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Maximizing T-complexity
Fundamenta Informaticae | 2016-04-28 | Paper |
Arithmetic complexity via effective names for random sequences
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Short lists for shortest descriptions in short time
Computational Complexity | 2014-11-26 | Paper |
Things that can be made into themselves
Information and Computation | 2014-07-18 | Paper |
A savings paradox for integer-valued gambling strategies
International Journal of Game Theory | 2014-06-27 | Paper |
Translating the Cantor set by a random real
Transactions of the American Mathematical Society | 2014-06-11 | Paper |
Selection by recursively enumerable sets
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Constant compression and random weights
Computability | 2013-01-30 | Paper |
How powerful are integer-valued martingales?
Theory of Computing Systems | 2012-12-07 | Paper |
| Constant compression and random weights | 2012-08-23 | Paper |
How to build a probability-free casino
Information and Computation | 2012-05-24 | Paper |
An incomplete set of shortest descriptions
Journal of Symbolic Logic | 2012-04-19 | Paper |
An incomplete set of shortest descriptions
Journal of Symbolic Logic | 2012-04-19 | Paper |
Closed left-r.e. sets
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Index sets and universal numberings
Journal of Computer and System Sciences | 2011-04-28 | Paper |
How powerful are integer-valued martingales?
Lecture Notes in Computer Science | 2010-07-29 | Paper |
Index sets and universal numberings
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Immunity and hyperimmunity for sets of minimal indices
Notre Dame Journal of Formal Logic | 2008-06-18 | Paper |
On the Turing degrees of minimal index sets
Annals of Pure and Applied Logic | 2007-09-28 | Paper |
