|
[1]
| |
Jason Teutsch.
A savings paradox for integer-valued martingales.
(submitted to International Journal of Game Theory).
[ .pdf ]
|
| |
|
[2]
| |
Randall Dougherty, Jack Lutz, Daniel Mauldin, and Jason Teutsch.
Translating the Cantor set by a random.
(submitted to Transactions of the American Mathematical
Society).
[ .pdf ]
|
| |
|
[3]
| |
Greg Clark and Jason Teutsch.
Maximizing T-complexity.
(submitted to Discrete Applied Mathematics).
[ .pdf ]
|
| |
|
[4]
| |
Frank Stephan and Jason Teutsch.
Things that can be made into themselves.
(submitted to Chicago Journal of Theoretical Computer
Science).
[ .pdf ]
|
| |
|
[5]
| |
Wolfgang Merkle and Jason Teutsch.
Constant compression and random weights.
(accepted to CiE's anticipated new journal Computability).
[ .pdf ]
|
| |
|
[6]
| |
Bjørn Kjos-Hanssen, Frank Stephan, and Jason Teutsch.
Arithmetic complexity via effective names for random sequences.
(to appear in ACM Transactions on Computational Logic).
[ slides |
.pdf ]
|
| |
|
[7]
| |
Frank Stephan and Jason Teutsch.
An incomplete
set of shortest descriptions.
The Journal of Symbolic Logic, 77(1):291-307, March 2012.
[ slides |
.pdf ]
|
| |
|
[8]
| |
Adam Chalcraft, Randall Dougherty, Chris Freiling, and Jason Teutsch.
How to build a
probability-free casino.
Information and Computation, 211:160-164, 2012.
[ slides |
.pdf ]
|
| |
|
[9]
| |
Laurent Bienvenu, Frank Stephan, and Jason Teutsch.
How powerful are
integer-valued martingales?
Theory of Computing Systems.
Special issue for CiE 2010.
[ slides |
.pdf ]
|
| |
|
[10]
| |
Sanjay Jain, Frank Stephan, and Jason Teutsch.
Index sets and
universal numberings.
Journal of Computer and System Sciences, 77(4):760-773, 2011.
[ slides |
.pdf ]
|
| |
|
[11]
| |
Frank Stephan and Jason Teutsch.
Immunity and
hyperimmunity for sets of minimal indices.
Notre Dame Journal of Formal Logic, 49(2):107-125, 2008.
[ .pdf ]
|
| |
|
[12]
| |
Jason Teutsch.
On the Turing
degrees of minimal index sets.
Annals of Pure and Applied Logic, 148:63-80, 2007.
[ .pdf ]
|
| |
|
[1]
| |
Wolfgang Merkle and Jason Teutsch.
Constant
compression and random weights.
In 29th International Symposium on Theoretical Aspects of
Computer Science (STACS 2012), volume 14 of Leibniz International
Proceedings in Informatics (LIPIcs), pages 172-181, Dagstuhl, Germany,
2012.
[ .pdf ]
|
| |
|
[2]
| |
Sanjay Jain, Frank Stephan, and Jason Teutsch.
Closed
left-r.e. sets.
In Theory and Applications of Models of Computation (TAMC
2011), volume 6648 of Lecture Notes in Computer Science, pages
218-229. Springer Berlin / Heidelberg, 2011.
[ .pdf ]
|
| |
|
[3]
| |
Laurent Bienvenu, Frank Stephan, and Jason Teutsch.
How powerful are
integer-valued martingales?
In Programs, Proofs, Processes (CiE 2010), volume 6158 of
Lecture Notes in Computer Science, pages 59-68. Springer-Verlag, Berlin,
Heidelberg, 2010.
[ slides |
.pdf ]
|
| |
|
[4]
| |
Sanjay Jain, Frank Stephan, and Jason Teutsch.
Index sets and
universal numberings.
In Mathematical Theory and Computational Practice (CiE 2009),
volume 5635 of Lecture Notes in Computer Science, pages 270-279.
Springer-Verlag, Berlin, Heidelberg, 2009.
[ slides |
.pdf ]
|
| |
|
[5]
| |
Jason R. Teutsch.
Noncomputable Spectral
Sets.
PhD thesis, Indiana University, 2007.
[ ArXiv |
slides ]
|
| |
|
[6]
| |
Pascal O. Vontobel, Roxana Smarandache, Negar Kiyavash, Jason Teutsch, and
Dejan Vukobratovic.
On the minimal
pseudo-codewords of codes from finite geometries.
In Proceedings of IEEE International Symposium on Information
Theory, pages 980-984, Adelaide, Australia, Sept. 2005.
[ ArXiv ]
|
| |