Continuous and monotone machines

Michal Konečný, Florian Steinberg, Holger Thies

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

Abstract

We investigate a variant of the fuel-based approach to modeling diverging computation in type theories and use it to abstractly capture the essence of oracle Turing machines. The resulting objects we call continuous machines. We prove that it is possible to translate back and forth between such machines and names in the standard function encoding used in computable analysis. Put differently, among the operators on Baire space, exactly the partial continuous ones are implementable by continuous machines and the data that such a machine provides is a description of the operator as a sequentially realizable functional. Continuous machines are naturally formulated in type theories and we have formalized our findings in Coq as part of Incone, a Coq library for computable analysis. The correctness proofs use a classical meta-theory with countable choice. Along the way we formally prove some known results such as the existence of a self-modulating modulus of continuity for partial continuous operators on Baire space. To illustrate their versatility we use continuous machines to specify some algorithms that operate on objects that cannot be fully described by finite means, such as real numbers and functions. We present particularly simple algorithms for finding the multiplicative inverse of a real number and for composition of partial continuous operators on Baire space. Some of the simplicity is achieved by utilizing the fact that continuous machines are compatible with multivalued semantics.

Original languageEnglish
Title of host publication45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020
EditorsJavier Esparza, Daniel Kral�, Daniel Kral�
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771597
DOIs
Publication statusPublished - Aug 1 2020
Event45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020 - Prague, Czech Republic
Duration: Aug 25 2020Aug 26 2020

Publication series

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

Conference

Conference45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020
CountryCzech Republic
CityPrague
Period8/25/208/26/20

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'Continuous and monotone machines'. Together they form a unique fingerprint.

Cite this