Filter Results:
- Full text PDF available (22)
Publication Year
1989
2007
- This year (0)
- Last 5 years (0)
- Last 10 years (0)
Publication Type
Co-author
Journals and Conferences
Learn More
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)
- Dina Q. Goldin
- FoIKS
- 2000
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)
- Dina Q. Goldin, Scott A. Smolka, Paul C. Attie, Elaine L. Sonderegger
- Inf. Comput.
- 2004
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)
- Dina Q. Goldin, Peter Wegner
- CiE
- 2005
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)
- Paris C. Kanellakis, Dina Q. Goldin
- TACS
- 1994
- David Bernstein, Dina Q. Goldin, +4 authors Ron Y. Pinter
- PLDI
- 1989
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)
- Peter Wegner, Dina Q. Goldin
- Conceptual Modeling
- 1997
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)
- Peter Wegner, Dina Q. Goldin
- Commun. ACM
- 2003
Seeking appropriate methods to model computing and human thought.
- Dina Q. Goldin, Peter Wegner
- Paraconsistent Computational Logic
- 2002
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)
- Peter Wegner, Dina Q. Goldin
- Electr. Notes Theor. Comput. Sci.
- 1999
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)