20 citations · 97 across the 14 of their papers we have counts for
Showing math.LOShow all
3 papers · 1 filter
math.LO2014★ 1 cited
On approximate decidability of minimal programs
Jason Teutsch, Marius Zimand
An index in a numbering of partial-recursive functions is called minimal if every lesser index computes a different function from . Since the 1960's it has been known that,…
math.LO2010★ 6 cited
Arithmetic complexity via effective names for random sequences
Bjørn Kjos-Hanssen, Frank Stephan, Jason R. Teutsch
We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the c…
math.LO2007★ 5 cited
Noncomputable Spectral Sets
Jason Teutsch
It is possible to enumerate all computer programs. In particular, for every partial computable function, there is a shortest program which computes that function. f-MIN is the set…