#### Filter Results:

- Full text PDF available (38)

#### Publication Year

1994

2017

- This year (1)
- Last 5 years (11)
- Last 10 years (41)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Kohtaro Tadaki
- ArXiv
- 2002

We generalize the concept of randomness in an infinite binary sequence in order to characterize the degree of randomness by a real number D > 0. Chaitin's halting probability Ω is generalized to Ω D whose degree of randomness is precisely D. On the basis of this generalization, we consider the degree of randomness of each point in Euclidean space through… (More)

- Kohtaro Tadaki, Tomoyuki Yamakami, Jack C. H. Lin
- SOFSEM
- 2004

A theory of one-tape linear-time Turing machines is quite different from its polynomial-time counterpart. This paper discusses the computational complexity of one-tape Turing machines of various machine types (deterministic, nondeterministic, reversible, alternating, prob-abilistic, counting, and quantum Turing machines) that halt in time O(n), where the… (More)

- Kohtaro Tadaki
- ArXiv
- 2008

We develop a statistical mechanical interpretation of algorithmic information theory by introducing the notion of thermodynamic quantities, such as free energy, energy, statistical mechanical entropy, and specific heat, into algorithmic information theory. We investigate the properties of these quantities by means of program-size complexity from the point… (More)

- Shigeo Tsujii, Kohtaro Tadaki, Ryou Fujita
- IACR Cryptology ePrint Archive
- 2004

- Kohtaro Tadaki
- 2009

Chaitin [G. introduced his Ω number as a concrete example of random real. The real Ω is defined as the probability that an optimal computer halts, where the optimal computer is a universal decoding algorithm used to define the notion of program-size complexity. Chaitin showed Ω to be random by discovering the property that the first n bits of the base-two… (More)

- Kohtaro Tadaki
- ArXiv
- 2010

In 1975 Chaitin introduced his Ω number as a concrete example of random real. The real Ω is defined based on the set of all halting inputs for an optimal prefix-free machine U , which is a universal decoding algorithm used to define the notion of program-size complexity. Chaitin showed Ω to be random by discovering the property that the first n bits of the… (More)

- S Marder, T Winkler, K Tadaki, S Bobbink, W O Robertson
- Veterinary and human toxicology
- 2001

The State of Washington mandated the use of imprints on all prescription drugs in 1980 and for "OTC's" in 1991. The FDA implemented federal requirements in 1995. Unfortunately, the FDA permitted the continued use of symbols, logotypes, and trademarks as code components, limiting the use of automated recognition systems. Analyses of several week-long samples… (More)

- Shigeo Tsujii, Kohtaro Tadaki, Ryou Fujita
- IACR Cryptology ePrint Archive
- 2006

We proposed the concept, piece in hand (soldiers in hand) matrix and have developed the framework based on the concept so far. The piece in hand matrix is a general concept which can be applicable to any type of multivariate public key cryptosystems to enhance their security. In this paper, we make improvements in the PH matrix method as follows. (i) In the… (More)

To help the study of constructing a formal neuron by computer, we propose a logic-based dynamical theory for a genesis of the biological threshold which specific proteins, such as ion channel proteins, or their networks can produce. By viewing such a protein or a protein network as a computational machine, the statements concerning the states of reaction… (More)

- Kohtaro Tadaki
- 2007 IEEE International Symposium on Information…
- 2007

In this paper we develop a statistical mechanical interpretation of the noiseless source coding scheme based on an absolutely optimal instantaneous code. The notions in statistical mechanics such as statistical mechanical entropy, temperature, and thermal equilibrium are translated into the context of noiseless source coding. Especially, it is discovered… (More)