Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms

DOI10.1016/J.AMC.2009.04.058zbMath1192.68843OpenAlexW2164331989MaRDI QIDQ1036533

J. V. Tucker, B. C. Thompson, Jeffery Zucker

Publication date: 13 November 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.04.058

zbMATH Keywords

dynamical systemsstreamscomputability on topological algebrassynchronous concurrent algorithmsequational specificationscomputable physical systemsmany sorted algebras

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (5)

Coupling CMLs and the synchronization of a multilayer neural computing system ⋮ Generalizing Computability Theory to Abstract Algebras ⋮ Lyapunov exponent spectrum for a generalized coupled map lattice ⋮ Continuity of operators on continuous and discrete time streams ⋮ Reconstructing the heart

Cites Work

• Computability of analog networks
• Algebraic specifications of computable and semicomputable data types
• The concurrent assignment representation of synchronous systems
• Hardware specification, verification and synthesis: mathematical aspects. Mathematical Sciences Institute workshop, Ithaca, NY, USA, July 5--7, 1989. Proceedings
• Computation by `While' programs on topological partial algebras
• Correct hardware design and verification methods. IFIP WG10.2 Advanced research working conference, CHARME '93, Arles, France, May 24-26, 1993. Proceedings
• Algebraic models of correctness for abstract pipelines.
• Hierarchical reconstructions of cardiac tissue
• Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
• Algebraic models of microprocessors architecture and organisation
• Algebraic models of behaviour and correctness of SMT and CMT processors
• Verifying an infinite systolic algorithm using third-order equational methods
• The completeness of the algebraic specification methods for computable data types
• Theoretical Foundations of VLSI Design
• Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
• Coupled map lattices as computational systems
• Abstract versus concrete computation on metric partial algebras
• Abstract computability and algebraic specification
• A logical calculus of the ideas immanent in nervous activity
• Algebraic models of correctness for microprocessors
• Correctness of dataflow and systolic algorithms using algebras of streams
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms