Computability of Probability Distributions and Distribution Functions (2009)
Mori, Takakazu, Tsujii, Yoshiki, Yasugi, Mariko
We define the computability of probability distributions on the real line as well as that of distribution functions. Mutual relationships between the computability notion of a probability...
Random Iteration Algorithm for Graph-Directed Sets (2009)
Tsujii, Yoshiki, Mori, Takakazu, Yasugi, Mariko, Tsuiki, Hideki
A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton's theorem, it is shown that almost all sequences obtained by this algorithm reflect a...
Fine-computable functions and Effective Fine-convergence (2008)
Takakazu Mori, Yoshiki Tsujii, Mariko Yasugi
In this article, we discuss the Fine computability and the effective Fine convergence for functions on [0, 1) with respect to the Fine metric as the beginning of the effective Walsh-Fourier analysis....
Archive for Mathematical Logic manuscript No. (will be inserted by the editor) (2008)
Mariko Yasugi, Yoshiki Tsujii, Takakazu Mori, Rademacher Function System
Received: date / Revised version: date – c ○ Springer-Verlag 2004 Abstract. An effective sequence of unifomities on a set and its limit are defined. By taking the diagonal of the limit space, we...
Sequential Computability of a Function. Effective Fine Space and Limiting Recursion 1 (2008)
Mariko Yasugi, Yoshiki Tsujii, Takakazu Mori
Abstract: We consider real sequences in I = [0, 1) and real functions on I. Itis first shown that, as for real sequences from I, R-computability (computability with respect to the Euclidean topology)...
The e ective sequence of uniformities and its limit: as a methodology (2008)
Mariko Yasugi, Takakazu Mori, Yoshiki Tsujii
in computable analysis
M.Yasugi, Inference within Knowledge (2007)
This paper applies the the technique of Game Logic GL! , which has recently been formulated by Kaneko and Nagashima, to Mccarthy's Three Wise Men Puzzle. The analysis makes it clear what one...
Contents 1 Our standpoint We are to discuss how to view notions of computability for discontinuous functions. We confine ourselves to real-valued functions from some spaces. Our standpoint in...
Modified Realizability For, Masako Washihara, Mariko Yasugi, Mariko Yasugi, Takakazu Mori, ...
s of papers:Helsinki, 1990), vol.56(1991), 1150 [31] Mariko Yasugi, Yoshiki Tsujii and Takakazu Mori A metatheory of nonstandard analysis, Tsukuba J. Math. vol.17(1993), 251-265 [32] Mariko Yasugi...
An MR-complete extension of extension of TRDB and its functional interpretation (2007)
Osamu Takaki, Mariko Yasugi, O Takaki, M Yasugi
In this paper, we extend a functional interpretation to transfinite types. To be more precise, we define a modified realizability interpretation of a constructive arithmetic with a certain inductive...
Inference within Knowledge (2007)
Sobei Oda And, Sobei H. Oda, Mariko Yasugi
This paper applies the the technique of Game Logic GL! , which has recently been formulated by Kaneko and Nagashima, to Mccarthy's Three Wise Men Puzzle. The analysis makes it clear what one...
Mariko Yasugi, Masako Washihara
Abstract We will speculate on some computational properties of the system of Rademacher functions fOE n g. The n-th Rademacher function OE n is a step
Memoirs of a Proof Theorist : Gödel and Other Logicians (2003)
Takeuti, Gaisi, Yasugi, Mariko (tr.), Passell, Nicholas (tr.)
981-238-279-8
Some Properties of the Effectively Uniform Topological Space (2000)
Yoshiki Tsujii, Mariko Yasugi, Takakazu Mori
Our main objective is to investigate algorithmic features latent in some discontinuous functions in terms of uniform topological spaces. We develop the theory of computability structure and...
Computability properties of the Gauian function (1999)
Mariko Yasugi, Vasco Brattka, Masako Washihara
We speculate on the Gauian function [x] as an example of a noncontinuous function which is nevertheless possessed of some properties of computability. An algorithm how to compute [x] for a single...
A Proof-Theoretic Approach to Knowledge (1999)
We speculate on logical aspects of the so-called three wise men puzzle with proof-theoretic methods. We propose and study the following. (1) Logical ability of each player of a puzzle is equivalent...
A Proof-Theoretic Approach to Knowledge (1999)
We speculate on logical aspects of the so-called three wise men puzzle with proof-theoretic methods. We propose and study the following. (1) Logical ability of each player of a puzzle is equivalent...
Inference within Knowledge (1999)
This paper applies the the technique of Game Logic GL! , which has recently been formulated by Kaneko and Nagashima, to Mccarthy's Three Wise Men Puzzle. The analysis makes it clear what one...
A Proof-Theoretic Approach to Knowledge (1999)
rators K 1 and K 2 . It is essentially equivalent to the modal logic S4, with two neccesity operators. For technical reasons, we employ a sequential calculus. The cut elimination theorem for KL can...
symposium articles : A note on the wise girls puzzle
This article analyzes the two wise girls puzzle, which is a simpler variant of the so-called three wise men puzzle, with some proof-theoretic tools. We formulate the puzzle in an epistemic logic. Our...
Rademacher Functions and Computability
Mariko Yasugi, Masako Washihara
consulted [1] for this function system.) In the traditional computable analysis, a real-valued function f on the compact interval [0; 1] can be computable (called G-computable, indicating...