Continuity of operators on continuous and discrete time streams
DOI10.1016/J.TCS.2011.04.012zbMATH Open1251.68141OpenAlexW1995730325MaRDI QIDQ549207FDOQ549207
Authors: John V. Tucker, Jeffery Zucker
Publication date: 7 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.012
Recommendations
compact-open topologyfixed pointstopological algebrasanalog computinganalog networkscontinuous stream operationscontinuous time streamsdiscrete time streamsHadamard's principlesynchronous concurrent algorithms
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Fixed-point and coincidence theorems (topological aspects) (54H25) Function spaces in general topology (54C35) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Concrete models of computation for topological algebras
- Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
- Abstract versus concrete computation on metric partial algebras
- Continuity of operators on continuous and discrete time streams
- A survey of stream processing
- Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms
- Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
- Computability in quantum mechanics.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Abstract versus concrete computability: the case of countable algebras
- Computability of analog networks
Cited In (8)
- New Computational Paradigms
- Generalizing Computability Theory to Abstract Algebras
- Characterizations of semicomputable sets of real numbers
- Continuity of operators on continuous and discrete time streams
- On \((\alpha, \nu)\)-relaxed polygonal metric spaces and fixed point results
- Fixed Point Techniques in Analog Systems
- A non-standard semantics for Kahn networks in continuous time
- Feferman on Computability
This page was built for publication: Continuity of operators on continuous and discrete time streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549207)