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.
Topological Interpretation of Interactive Computation
Merelli, Emanuela
;
2019-01-01
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Lecture Notes in Computer Science, 11500.pdf
solo gestori di archivio
Tipologia:
Versione Editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
1.92 MB
Formato
Adobe PDF
|
1.92 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
|
arXiv 1908.0426v1 3 Ago 2019.pdf
accesso aperto
Descrizione: Documento depositato in arXiv:1908.04264v1 [cs.LO] 3 Aug 2019
Tipologia:
Documento in Post-print
Licenza:
DRM non definito
Dimensione
6.16 MB
Formato
Adobe PDF
|
6.16 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
