Researchers Database

KAMO Hiroyasu

FacultyFaculty Division of Human Life and Environmental Sciences Research Group of Information and Communication Technology for Life
PositionAssociate Professor
Last Updated :2024/04/12


Profile and Settings

  • Name (Japanese)

  • Name (Kana)



  • (BLANK), Kyoto University

Research Interests

  • Computability in Analysis
  • mathematical logic
  • Urysohn's universal metric space

Research Areas

  • Informatics, Information theory
  • Natural sciences, Basic mathematics


  • Apr. 1991, Apr. 1992, Kyoto University, Graduate School, Division of Natural Science, 数理解析専攻
  • Apr. 1989, Mar. 1991, Kyoto University, Graduate School, Division of Natural Science, 数理解析専攻
  • 1989, Kyoto University, Faculty of Science


Published Papers

  • Refereed, Electronic Notes in Theoretical Computer Science, Effective Dini's theorem on effectively Compact metric spaces, Hiroyasu Kamo, We show that if a computable sequence of real-valued functions on an effectively compact metric space converges pointwise monotonically to a computable function, then the sequence converges effectively uniformly to the function. This is an effectivized version of Dini's Theorem. © 2005 Elsevier B.V., 03 Feb. 2005, 120, 73, 82, International conference proceedings, 10.1016/j.entcs.2004.06.035
  • Refereed, Informatik Berichte --- Computability and Complexity in Analysis, Computability and computable uniqueness of Urysohn's universal metric space, KAMO Hiroyasu, 2005, 326, 149-159
  • Refereed, INFORMATIK BERICHTE-Computability and Complexity in Analysis, Effective Contraction Theorem and its Application, KAMO Hiroyasu, 2000, 272, 9, 157-164
  • Refereed, MATHEMATICAL LOGIC QUARTERLY, WILEY-V C H VERLAG GMBH, Computability of self-similar sets, H Kamo; K Kawamura, We investigate computability of a self-similar set on a Euclidean space. A nonempty compact subset of a Euclidean space is called a self-similar set if it equals to the union of the images of itself by some set of contractions. The main result in this paper is that if all of the contractions are computable, then the self-similar set is a recursive compact set. A further result on the case that the self-similar set forms a curve is also discussed., 1999, 45, 1, 23, 30, Scientific journal


  • Not Refereed,, Schellbach-style Formulae for the Derousseau-Pampuch Generalizations of the Malfatti Circles, KAMO Hiroyasu, Apr. 2013
  • Not Refereed, 電気学会情報処理研究会資料IP-97-15, 自己相似集合の計算可能性について-計算量をめざして-, KAMO Hiroyasu, 1997, 17-22
  • Not Refereed, Annual Reports of Graduate School of Human Culture, Nara Women's University, Nara Women's University, Computability of Self-affine Sets (共著), KAMO Hiroyasu, 1996, 12, 12, 135-150, 150
  • Not Refereed, IPSJ SIG Notes, Information Processing Society of Japan (IPSJ), Computability of Koch Curve and Koch Island(共著), KAMO Hiroyasu, Koch curve is known as a typical self-similar set on Euclidean plane. Koch island is a closed set surrounded by three copies of Koch curve. We investigate them from the viewpoint of computability. In this paper, we define computability of a curve and that of a closed set as an application of classical computable analisys to Euclidean spaces and show that Koch curve is a computable curve and both Koch curve and Koch island are computable closed sets., 1996, 96, 100, 1-8, 8
  • Not Refereed, 信学技報, Declarative Semantics for Modularized Prolog with Herbrand models, KAMO Hiroyasu, 1991, 91, 93

Books etc

  • 新版 情報処理ハンドブック(情報処理学会編、共著), オーム社, KAMO Hiroyasu, 1995, Not Refereed


  • KAMO Hiroyasu, 代数, 論理, 幾何と情報科学研究集会 (ALGI26), ユークリッド幾何の問題への数式処理システムの応用, Aug. 2015, Tottori, False
  • KAMO Hiroyasu, SLACS 2014 (記号論理と情報科学 研究集会), 三角形に関する平面ユークリッド幾何への数式処理の応用, May 2014, 記号論理と情報科学 研究集会, 東京工業大学, False
  • KAMO Hiroyasu, 第二十三回 ALGI(代数,論理,幾何と情報科学研究集会), 三角形に関する平面ユークリッド幾何への数式処理の応用, Sep. 2012
  • KAMO Hiroyasu, SLACS 2012 (記号論理と情報科学 研究集会), 三角形に関する平面ユークリッド幾何への数式処理の応用, Sep. 2012

Research Projects

  • 位相空間での計算可能性解析学, 0, 0, 0, Competitive research funding
  • 論理プログラム言語の意味論に関する研究, 0, 0, 0, Competitive research funding
  • Computable Analysis on Topological Spaces, 0, 0, 0, Competitive research funding
  • Study on Semantics of Logic Programming Languages, 0, 0, 0, Competitive research funding

Copyright © MEDIA FUSION Co.,Ltd. All rights reserved.