Idempotent Turing Machines

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publication46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021
EditorsFilippo Bonchi, Simon J. Puglisi
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772013
DOIs
Publication statusPublished - 2021 Aug 1
Event46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021 - Tallinn, Estonia
Duration: 2021 Aug 232021 Aug 27

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume202
ISSN (Print)1868-8969

Conference

Conference46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021
Country/TerritoryEstonia
CityTallinn
Period21/8/2321/8/27

Keywords

  • Computable functions
  • Computation model
  • Idempotent functions
  • Turing machines

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Idempotent Turing Machines'. Together they form a unique fingerprint.

Cite this