Abstract
The notion of feedback and information flow is a fundamental concept arising in many classical areas of computing. In the late 1980s and early 1990s, an algebraic structure dealing with cyclic operations emerged from various fields, including flowchart schemes, dataflow with feedback, iteration theories, action calculi in concurrency theory, proof theory (Linear Logic and Geometry of Interaction), and network algebra, as well as in pure mathematics. This structure, now known as a “traced monoidal category”, was formally introduced in an influential paper of Joyal, Street and Verity (1996) from current work in topology and knot theory. However these authors were also keenly aware of its potential applicability. Since then, such structures – with variations – have been pursued in several areas of mathematics, logic and theoretical computer science, including game semantics, quantum programming languages and quantum protocols, and computational biology. We shall survey applications in logic and theoretical computer science and discuss progress towards an abstract geometry of algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scott, P.J. (2007). Traces, Feedback, and the Geometry of Computation (Abstract). In: Csuhaj-Varjú, E., Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 2007. Lecture Notes in Computer Science, vol 4639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74240-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-74240-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74239-5
Online ISBN: 978-3-540-74240-1
eBook Packages: Computer ScienceComputer Science (R0)