License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2021.79
URN: urn:nbn:de:0030-drops-145191
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14519/
Go to the corresponding LIPIcs Volume Portal

Nakano, Keisuke

Idempotent Turing Machines

pdf-format:
LIPIcs-MFCS-2021-79.pdf (0.8 MB)

Abstract

A function f is said to be idempotent if f(f(x)) = f(x) holds whenever f(x) is defined. This paper presents a computation model for idempotent functions, called an idempotent Turing machine. The computation model is necessarily and sufficiently expressive in the sense that not only does it always compute an idempotent function but also every idempotent computable function can be computed by an idempotent Turing machine. Furthermore, a few typical properties of the computation model such as robustness and universality are shown. Our computation model is expected to be a basis of special-purpose (or domain-specific) programming languages in which only but all idempotent computable functions can be defined.

BibTeX - Entry

@InProceedings{nakano:LIPIcs.MFCS.2021.79,
  author =	{Nakano, Keisuke},
  title =	{{Idempotent Turing Machines}},
  booktitle =	{46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
  pages =	{79:1--79:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-201-3},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{202},
  editor =	{Bonchi, Filippo and Puglisi, Simon J.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/14519},
  URN =		{urn:nbn:de:0030-drops-145191},
  doi =		{10.4230/LIPIcs.MFCS.2021.79},
  annote =	{Keywords: Turing machines, Idempotent functions, Computable functions, Computation model}
}

Keywords: Turing machines, Idempotent functions, Computable functions, Computation model
Collection: 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Issue Date: 2021
Date of publication: 18.08.2021

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI