• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2006 Fiscal Year Final Research Report Summary

Computability of discontinuous functions-Towards its paradigm

Research Project

Project/Area Number 16340028
Research Category

Grant-in-Aid for Scientific Research (B)

Allocation TypeSingle-year Grants
Section一般
Research Field General mathematics (including Probability theory/Statistical mathematics)
Research InstitutionKyoto Sangyo University

Principal Investigator

YASUGI Mariko  Kyoto Sangyo University, Faculty of Science, Professor, 理学部, 教授 (90022277)

Co-Investigator(Kenkyū-buntansha) TSUJII Yoshiki  Kyoto Sangyo University, Faculty of Science, Professor, 理学部, 教授 (90065871)
MORI Takakazu  Kyoto Sangyo University, Faculty of Science, Professor, 理学部, 教授 (00065880)
YAMADA Shuji  Kyoto Sangyo University, Faculty of Science, Professor, 理学部, 教授 (30192404)
TSUIKI Hideki  Kyoto University, Graduate School of Human and Environmental Studies, Associate Professor, 大学院人間・環境学研究科, 助教授 (10211377)
HAYASHI Susumu  Kyoto University, Graduate School of Letters, Professor, 大学院文学研究科, 教授 (40156443)
Project Period (FY) 2004 – 2006
KeywordsComputable analysis / Effective continuity / Effective sequence of uniformities / limit / Effective sequence of Fine continuous functions / Effective Fine convergence of function sequences / Limit recursion / Proof animation / Fractals with infinite bases
Research Abstract

In studying computability of some real functions which are discontinuous with respect to the Euclidean metric, the most useful and natural METHOD is uniformization of the domain of a function by isolating the discontinuous points. A general theory of the effective uniform space, especially the space of Fine metric, has been clarified. For the computability problem of a function sequence whose functions have different discontinuity points, a theory of the effective sequence of uniformities and its limit has been developed. Admitting limiting recursive functions in characterizing the image of a computable sequence of elements by a discontinuous function is another theory. In a natural setting, these two theories are equivalent. We can claim that the theory of the effective uniformity (the sequence of effective uniformities) is the fundamental method for the computability of some discontinuous functions. Limiting recursion is equivalent with Sigma^0_1 excluded middle. The relative strength between Sigma^0_1 excluded middle and other semi-constructive principles have been worked out. As for functional analysis, effectivization of various theorems, mainly on the Banach space, has made progress. A representation of real numbers in terms of {0,1,Bottom},characterizing the computability of real numbers has been studied. Some counter-examples have been constructed :a function sequence which is sequentially computable but has no effectively continuous points and a function which is Banach-Mazur computable but is not Markov computable. In applications, dynamics of double rotation maps, description of the inverse problem in multi-sectorial growth theory, the computability problem of fractals with infinitely many contraction maps, reorganization of hardware and software for discovery of non-trivial knots have been studied.

  • Research Products

    (16 results)

All 2007 2006 2005 2004 Other

All Journal Article (14 results) Book (2 results)

  • [Journal Article] The effective sequence of uniformities and its limit as a methodology in computable analysis2007

    • Author(s)
      M.Yasugi, T.Mori, Y.Tsujii
    • Journal Title

      Annals of the Japan Association for Philosophy of Science 15-2

      Pages: 99-121

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] Can proofs be animated by games?2007

    • Author(s)
      S.Hayashi
    • Journal Title

      Fundamenta Informaticae 77

      Pages: 1-13

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] Mathematics based on Incremental Learning-Excluded middle and Inductive inference-2006

    • Author(s)
      S.Hayashi
    • Journal Title

      Theoretical Computer Science 350 (1)

      Pages: 125-139

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] Mathematics based on Incremental Learning-Excluded middle and Inductive inference-2006

    • Author(s)
      S.Hayashi
    • Journal Title

      Theoretical Computer Science 350(1)

      Pages: 125-139

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] A Middleman in An Ambiguous Situation : Experimental Evidence2006

    • Author(s)
      K.Ogawa, Y.Koyama, S.Oda
    • Journal Title

      Journal of Socio-Economics (in press)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] Sequential computability of a function-Effective Fine space and limiting recursion2005

    • Author(s)
      M.Yasugi, et al.
    • Journal Title

      Journal of Universal Computer Science 11-12

      Pages: 2179-2191

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] Fine computable functions and effective Fine convergence2005

    • Author(s)
      T.Mori, et al.
    • Journal Title

      Proceedings of CCA2005 : Informatik Berichte, FernUniversitaet in Hagen 326-7

      Pages: 177-198

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] Streams with a bottom in functional languages2005

    • Author(s)
      H.Tsuiki, et al.
    • Journal Title

      Lecture Notes in Computer Science 3444

      Pages: 201-216

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] Mathematics based on incremental learning-Excluded middle and inductive inference2005

    • Author(s)
      S.Hayashi, et al.
    • Journal Title

      Theoretical Computer Science 350

      Pages: 125-139

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] Double rotations2005

    • Author(s)
      H.Suzuki, et al.
    • Journal Title

      Discrete and Continuous Dynamical Systems 13

      Pages: 515-532

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] Computability of a function with jumps-Effective uniformity and limiting recursion-2005

    • Author(s)
      M.Yasugi, et al.
    • Journal Title

      Topology and its Applications 146-147

      Pages: 563-582

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] Sequential computability of a function-Diagonal computability and limiting recursion-2005

    • Author(s)
      Y.Tsujii, et al.
    • Journal Title

      Electronic Notes on Computer Science 120

      Pages: 187-199

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] Compact metric spaces as minimal-limit sets in domains of bottomed sequences bottomed sequences2004

    • Author(s)
      H.Tsuiki, et al.
    • Journal Title

      Mathematical Structures in Computer Science 14(6)

      Pages: 853-878

    • Description
      「研究成果報告書概要(和文)」より
  • [Journal Article] A Middleman in An Ambiguous Situation : Experimental Evidence

    • Author(s)
      K.Ogawa, Y.Koyama, S.Oda
    • Journal Title

      Journal of Socio-Economics (in print)

    • Description
      「研究成果報告書概要(和文)」より
  • [Book] ゲーデル不完全性定理2006

    • Author(s)
      林晋, 八杉満利子(訳・解説)
    • Total Pages
      309
    • Publisher
      岩波書店(岩波文庫)
    • Description
      「研究成果報告書概要(和文)」より
  • [Book] Godel Incompleteness Theorem (Translation and exposition in Japanese)2006

    • Author(s)
      S.Hayashi, M.Yasugi
    • Total Pages
      309
    • Publisher
      Iwanami Bunko(Iwanami Shoten)
    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 2008-05-27  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi