Skip to main navigation Skip to search Skip to main content

Topological interpretation of interactive computation

  • University of Camerino

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

1 Scopus citations

Abstract

It is a great pleasure to write this tribute in honor of Scott A. Smolka on his 65th birthday. We revisit Goldin, Smolka hypothesis that persistent Turing machine (PTM) can capture the intuitive notion of sequential interaction computation. We propose a topological setting to model the abstract concept of environment. We use it to define a notion of a topological Turing machine (TTM) as a universal model for interactive computation and possible model for concurrent computation.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages205-224
Number of pages20
DOIs
StatePublished - 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11500 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Persistent Turing machine
  • Topological environment
  • Topological Turing machine

Fingerprint

Dive into the research topics of 'Topological interpretation of interactive computation'. Together they form a unique fingerprint.

Cite this