73 citations · 168 across the 24 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2009★ 9 cited
Partial randomness and dimension of recursively enumerable reals
Kohtaro Tadaki
A real αis called recursively enumerable ("r.e." for short) if there exists a computable, increasing sequence of rationals which converges to α. It is known that the randomness of…
cs.CC2003
Theory of One Tape Linear Time Turing Machines
Kohtaro Tadaki, Tomoyuki Yamakami, Jack C. H. Lin
A theory of one-tape (one-head) linear-time Turing machines is essentially different from its polynomial-time counterpart since these machines are closely related to finite state a…