Theory of computation over stream algebras, and its applications

DOI10.1007/3-540-55808-X_6zbMath1493.68142OpenAlexW1593704070MaRDI QIDQ5096820

J. V. Tucker, Jeffery Zucker

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55808-x_6

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Abstract data types; algebraic specification (68Q65) Other nonclassical models of computation (68Q09)

Related Items (2)

Computation by `While' programs on topological partial algebras ⋮ Hierarchical reconstructions of cardiac tissue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic specifications of computable and semicomputable data types
• Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
• Deterministic and nondeterministic computation, and horn programs, on abstract data types
• PROJECTIONS OF SEMICOMPUTABLE RELATIONS ON ABSTRACT DATA TYPES
• Examples of semicomputable sets of real and complex numbers
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

This page was built for publication: Theory of computation over stream algebras, and its applications