Constraints are a natural mechanism for the speci cation of similarity queries on time-series data. However, to realize the expressive power of constraint programming in this context, one mustâ€¦ (More)

Persistent Turing Machines (PTMs) are multitape machines with a persistent worktape preserved between interactions, whose inputs and outputs are dynamically generated streams of tokens (strings).â€¦ (More)

This paper presents Persistent Turing Machines (PTMs), a new way of interpreting Turing-machine computation, based on dynamic stream semantics. A PTM is a Turing machine that performs an in niteâ€¦ (More)

According to the interactive view of computation, communication happens during the computation, not before or after it. This approach, distinct from concurrency theory and the theory of computation,â€¦ (More)

Global register allocation and spilling is commonly performed by solving a graph coloring problem. In this paper we present a new coherent set of heuristic methods for reducing the amount of spillâ€¦ (More)

The irreducibility of interactive to algorithmic computing requires fundamental questions concerning models of computation to be reexamined. This paper reviews single-stream and multiple-streamâ€¦ (More)

The goal of computational logic is to allow us to model computation as well as to reason about it. We argue that a computational logic must be able to model interactive computation. We show thatâ€¦ (More)

This paper explores the role of coinductive methods in modeling finite interactive compu agents. The computational extension of computing agents from algorithms to interaction paralle mathematicalâ€¦ (More)