Speech is intelligible even when the temporal envelope of speech is distorted. The current study investigates how native and non-native speakers perceptually restore temporally distorted speech. Participants were native English speakers (NS), and native Japanese speakers who spoke English as a second language (NNS). In Experiment 1, participants listened to “locally time-reversed speech” where every x-ms of speech signal was reversed on the temporal axis. Here, the local time reversal shifted the constituents of the speech signal forward or backward from (...) the original position, and the amplitude envelope of speech was altered as a function of reversed segment length. In Experiment 2, participants listened to “modulation-filtered speech” where the modulation frequency components of speech were low-pass filtered at a particular cut-off frequency. Here, the temporal envelope of speech was altered as a function of cut-off frequency. The results suggest that speech becomes gradually unintelligible as the length of reversed segments increases (Experiment 1), and as a lower cut-off frequency is imposed (Experiment 2). Both experiments exhibit the equivalent level of speech intelligibility across six levels of degradation for native and non-native speakers respectively, which poses a question whether the regular occurrence of local time reversal can be discussed in the modulation frequency domain, by simply converting the length of reversed segments (ms) into frequency (Hz). (shrink)

There are close similarities between the Weihrauch lattice and the zoo of axiom systems in reverse mathematics. Following these similarities has often allowed researchers to translate results from one setting to the other. However, amongst the big five axiom systems from reverse mathematics, so far $\mathrm {ATR}_0$ has no identified counterpart in the Weihrauch degrees. We explore and evaluate several candidates, and conclude that the situation is complicated.

In this paper, we discuss guidelines for a reward design problem that defines when and what amount of reward should be given to the agent/s, within the context of reinforcement learning approach. We would like to take keepaway soccer as a standard task of the multiagent domain which requires skilled teamwork. The difficulties of designing reward for this task are due to its features as follows: i) since it belongs to the continuing task which has no explicit goal to achieve, (...) it is hard to tell when reward should be given to the agent/s. ii) since it is a multiagent cooperative task, it is hard to decide what is a fair share of reward for each agent's contribution to achieve the goal. Through some experiments, we show that the reward design have a major effect on the agent's behavior, and introduce the successful reward function that makes agents perform keepaway better and more interesting than the conventional one does. Finally, we explore the relationship between `reward design' and `acquired behaviors' from the viewpoint of teamwork. (shrink)

In this paper we formulate epsilon substitution method for a theory $\Pi _{2}^{0}$-FIX for non-monotonic $\Pi _{2}^{0}$ inductive definitions. Then we give a termination proof of the H-processes based on Ackermann [1].

We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. Our techniques employ deep results from effective descriptive set theory and recursion theory. In fact it is essential to extend several prominent results in recursion theory (e.g. the Shore-Slaman Join Theorem) to the setting of Polish spaces. As a by-product we give both positive and negative results on (...) the Martin Conjecture on the degree preserving Borel functions between Polish spaces. Additionally we prove results about the transfinite version as well as the computable version of the Decomposability Conjecture. (shrink)

Quantum measurement is a physical process. A system and an apparatus interact for a certain time period, and during this interaction, information about an observable is transferred from the system to the apparatus. In this study, we quantify the energy fluctuation of the quantum apparatus required for this physical process to occur autonomously. We first examine the so-called standard model of measurement, which is free from any non-trivial energy–time uncertainty relation, to find that it needs an external system that switches (...) on the interaction between the system and the apparatus. In such a sense this model is not closed. Therefore to treat a measurement process in a fully quantum manner we need to consider a “larger” quantum apparatus which works also as a timing device switching on the interaction. In this setting we prove that a trade-off relation, \, holds between the energy fluctuation \ of the quantum apparatus and the measurement time \. We use this trade-off relation to discuss the spacetime uncertainty relation concerning the operational meaning of the microscopic structure of spacetime. In addition, we derive another trade-off inequality between the measurement time and the strength of interaction between the system and the apparatus. (shrink)

The method of analytic tableaux is employed in many introductory texts and has also been used quite extensively as a basis for automated theorem proving. In this paper, we discuss the complexity of the system as a method for refuting contradictory sets of clauses, and resolve several open questions. We discuss the three forms of analytic tableaux: clausal tableaux, generalized clausal tableaux, and binary tableaux. We resolve the relative complexity of these three forms of tableaux proofs and also resolve the (...) relative complexity of analytic tableaux versus resolution. We show that there is a quasi-polynomial simulation of tree resolution by analytic tableaux; this simulation is close to optimal, since we give a matching lower bound that is tight to within a polynomial. (shrink)

We show that there is a computable procedure which, given an ∀∃-sentence ${\varphi}$ in the language of the partially ordered sets with a top element 1 and a bottom element 0, computes whether ${\varphi}$ is true in the Medvedev degrees of ${\Pi^0_1}$ classes in Cantor space, sometimes denoted by ${\mathcal{P}_s}$.

Consider a randomness notion C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document}. A uniform test in the sense of C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document} is a total computable procedure that each oracle X produces a test relative to X in the sense of C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document}. We say that a binary sequence Y is C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document}-random uniformly relative to (...) X if Y passes all uniform C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document} tests relative to X. Suppose now we have a pair of randomness notions C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document} and D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{D}}$$\end{document} where C⊆D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C} \subseteq \mathcal{D}}$$\end{document}, for instance Martin-Löf randomness and Schnorr randomness. Several authors have characterized classes of the form Low which consist of the oracles X that are so feeble that C⊆DX\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C} \subseteq \mathcal{D}^X}$$\end{document}. Our goal is to do the same when the randomness notion D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{D}}$$\end{document} is relativized uniformly: denote by Low \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\star}$$\end{document} the class of oracles X such that every C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{C}}$$\end{document}-random is uniformly D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{D}}$$\end{document}-random relative to X. We show that X∈Low⋆\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${X\in Low ^\star}$$\end{document} if and only if X is c.e. tt-traceable if and only if X is anticomplex if and only if X is Martin-Löf packing measure zero with respect to all computable dimension functions. We also show that X∈Low⋆\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${X\in Low^\star}$$\end{document} if and only if X is computably i.o. tt-traceable if and only if X is not totally complex if and only if X is Schnorr Hausdorff measure zero with respect to all computable dimension functions. (shrink)

In this article, we examine philosophy of sport as a field of study in Japan, its history, characteristics, and future prospects, as part of a contribution to the international development of the discipline of sport philosophy. The Japan Society for the Philosophy of Sport and Physical Education has been holding an annual sport philosophy conference every year since its inception in 1978. Nevertheless, the trends of sport philosophy in Japan have not been conveyed abroad. The language barrier between Japanese and (...) English as an international communication tool makes it difficult to spread our work on the philosophy of sport throughout the world. The question arises as to whether the philosophy of sport in Japan has the same trends as those in the Western countries. Is it reasonable to assume that it has different aspects and interests than philosophy of sport in English-speaking countries? We will also try to address these questions for our audience. (shrink)

This paper reports our research efforts on social robots that recognize interpersonal relationships. These investigations are carried out by observing group behaviors while the robot interacts with people. Our humanoid robot interacts with children by speaking and making various gestures. It identifies individual children by using a wireless tag system, which helps to promote interaction such as the robot calling a child by name. Accordingly, the robot is capable of interacting with many children, causing spontaneous group behavior from the children (...) around it. Here, group behavior is associated with social relationships among the children themselves. For example, a child may be accompanied by his or her friends and then play together with them. We propose the hypothesis that our interactive robot prompts a child’s friends to accompany him or her; thus, we can estimate their friendship by simply observing their accompanying behaviors. We conducted a field experiment for two weeks in a Japanese elementary school to verify this hypothesis. In the experiment, two “Robovie” robots were placed where children could freely interact with them during recesses. As a result, we found that they mostly prompted friend-accompanying behavior. Moreover, we could estimate some of their friendly relationships, in particular among the children who often appeared around the robot. For example, we could estimate 5% of all friendships with 80% accuracy, and 15% of them with nearly 50% accuracy. Thus, this result basically supports our hypothesis on friendship estimation from an interactive humanoid robot. We believe that this ability to estimate human relationships is essential for robots to behave socially. (shrink)

This paper deals with a proof theory for a theory T22 of recursively Mahlo ordinals in the form of Π2-reflecting on Π2-reflecting ordinals using a subsystem Od of the system O of ordinal diagrams in Arai 353). This paper is the first published one in which a proof-theoretic analysis à la Gentzen–Takeuti of recursively large ordinals is expounded.

Louveau showed that if a Borel set in a Polish space happens to be in a Borel Wadge class $$\Gamma $$, then its $$\Gamma $$ -code can be obtained from its Borel code in a hyperarithmetical manner. We extend Louveau’s theorem to Borel functions: If a Borel function on a Polish space happens to be a $$ \underset{\widetilde{}}{\varvec{\Sigma }}\hbox {}_t$$ -function, then one can find its $$ \underset{\widetilde{}}{\varvec{\Sigma }}\hbox {}_t$$ -code hyperarithmetically relative to its Borel code. More generally, we prove (...) extension-type, domination-type, and decomposition-type variants of Louveau’s theorem for Borel functions. (shrink)

In this article, we study an analogue of tt-reducibility for points in computable metric spaces. We characterize the notion of the metric tt-degree in the context of first-level Borel isomorphism. Then, we study this concept from the perspectives of effective topological dimension theory and of effective fractal dimension theory.

In this paper we formulate epsilon substitution method for a theory $\Pi _{2}^{0}$-FIX for non-monotonic $\Pi _{2}^{0}$ inductive definitions. Then we give a termination proof of the H-processes based on Ackermann [1].

Hilbert proposed the epsilon substitution method as a basis for consistency proofs. Hilbert's Ansatz for finding a solving substitution for any given finite set of transfinite axioms is, starting with the null substitution S0, to correct false values step by step and thereby generate the process S0,S1,… . The problem is to show that the approximating process terminates. After Gentzen's innovation, Ackermann 162) succeeded to prove termination of the process for first order arithmetic. Inspired by G. Mints as an Ariadne's (...) thread we formulate the epsilon substitution method for the theory ID1 of non-iterated inductive definitions for disjunctions of simply universal and existential operators, and give a termination proof of the H-process based on Ackermann 162). The termination proof is based on transfinite induction up to the Howard ordinal. (shrink)

This paper deals with a proof theory for a theory T3 of Π3-reflecting ordinals using the system O of ordinal diagrams in Arai 1375). This is a sequel to the previous one 1) in which a theory for recursively Mahlo ordinals is analyzed proof-theoretically.

コーシーとワイエルシュトラスによって構築されたε‐σ論法を論理学の基礎から解説。.

In this, journal, W. Buchholz gave an elegant proof of a characterization theorem for provably total recursive functions in the theory IDv for the v-times iterated inductive definitions . He characterizes the classes of functions by Hardy functions. In this note we will show that a slow growing analogue to the theorem can be obtained by a slight modification of Buchholz' proof.

We formulate epsilon substitution method for theories (H)α0 of absolute jump hierarchies, and give two termination proofs of the H-process: The first proof is an adaption of Mints M, Mints-Tupailo-Buchholz MTB, i.e., based on a cut-elimination of a specially devised infinitary calculus. The second one is an adaption of Ackermann Ack. Each termination proof is based on transfinite induction up to an ordinal θ(α0+ ω)0, which is best possible.

We gather the following miscellaneous results in proof theory from the attic.1. 1. A provably well-founded elementary ordering admits an elementary order preserving map.2. 2. A simple proof of an elementary bound for cut elimination in propositional calculus and its applications to separation problem in relativized bounded arithmetic below S21.3. 3. Equivalents for Bar Induction, e.g., reflection schema for ω logic.4. 4. Direct computations in an equational calculus PRE and a decidability problem for provable inequations in PRE.5. 5. Intuitionistic fixed (...) point theories which are conservative extensions of HA.6. 6. Proof theoretic strengths of classical fixed points theories.7. 7. An equivalence between transfinite induction rule and iterated reflection schema over IΣn.8. 8. Derivation lengths of finite rewrite rules reducing under lexicographic path orders and multiply recursive functions.Each section can be read separately in principle. (shrink)

We prove the Decomposability Conjecture for functions of Baire class $2$ from a Polish space to a separable metrizable space. This partially answers an important open problem in descriptive set theory.

Unter dem Titel Feuerbach und der Judaismus wird mit dieser Publikation ein neues Kapitel in der Feuerbachforschung aufgeschlagen, da erstmalig Feuerbachs Stellung zum Judaismus, aber auch sein Einfluß auf die deutsch-jüdische Philosophie ...

This paper reports our research efforts on social robots that recognize interpersonal relationships. These investigations are carried out by observing group behaviors while the robot interacts with people. Our humanoid robot interacts with children by speaking and making various gestures. It identifies individual children by using a wireless tag system, which helps to promote interaction such as the robot calling a child by name. Accordingly, the robot is capable of interacting with many children, causing spontaneous group behavior from the children (...) around it. Here, group behavior is associated with social relationships among the children themselves. For example, a child may be accompanied by his or her friends and then play together with them. We propose the hypothesis that our interactive robot prompts a child’s friends to accompany him or her; thus, we can estimate their friendship by simply observing their accompanying behaviors. We conducted a field experiment for two weeks in a Japanese elementary school to verify this hypothesis. In the experiment, two “Robovie” robots were placed where children could freely interact with them during recesses. As a result, we found that they mostly prompted friend-accompanying behavior. Moreover, we could estimate some of their friendly relationships, in particular among the children who often appeared around the robot. For example, we could estimate 5% of all friendships with 80% accuracy, and 15% of them with nearly 50% accuracy. Thus, this result basically supports our hypothesis on friendship estimation from an interactive humanoid robot. We believe that this ability to estimate human relationships is essential for robots to behave socially. (shrink)