Initiality, induction, and computability
Algebraic methods in semantics
Introduction to functional analysis, 2nd ed.
Introduction to functional analysis, 2nd ed.
Program correctness over abstract data types, with error-state semantics
Program correctness over abstract data types, with error-state semantics
Handbook of theoretical computer science (vol. B)
Dynamical systems, measures, and fractals via domain theory
Information and Computation
Handbook of logic in computer science (vol. 4)
Recursive characterization of computable real-valued functions and relations
Theoretical Computer Science - Special issue on real numbers and computers
Verification of sequential and concurrent programs (2nd ed.)
Verification of sequential and concurrent programs (2nd ed.)
Complexity and real computation
Complexity and real computation
Concrete models of computation for topological algebras
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computation by “while” programs on topological partial algebras
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computable analysis: an introduction
Computable analysis: an introduction
Computable functions and semicomputable sets on many-sorted algebras
Handbook of logic in computer science
Representations versus numberings: on the relationship of two computability notions
Theoretical Computer Science
Abstract computability and algebraic specification
ACM Transactions on Computational Logic (TOCL)
Mathematical Theory of Program Correctness
Mathematical Theory of Program Correctness
Scientific Computing
A Discipline of Programming
Theory of Computation over Stream Algebras, and its Applications
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Examples of Semicomputable Sets of Real and Complex Numbers
Constructivity in Computer Science, Summer Symposium
Hierarchies of total functionals over the reals
Theoretical Computer Science - Logic, semantics and theory of programming
The rational numbers as an abstract data type
Journal of the ACM (JACM)
Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
Theoretical Computer Science
Computability of analog networks
Theoretical Computer Science
Computing Properties of Numerical Imperative Programs by Symbolic Computation
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Programming Experimental Procedures for Newtonian Kinematic Machines
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Oracles and Advice as Measurements
UC '08 Proceedings of the 7th international conference on Unconventional Computing
On the Continuity of Effective Multifunctions
Electronic Notes in Theoretical Computer Science (ENTCS)
Reducibility of domain representations and cantor–weihrauch domain representations
Mathematical Structures in Computer Science
Primitive recursive selection functions over abstract algebras
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Bimonadic semantics for basic pattern matching calculi
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
How to compare the power of computational models
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
A network model of analogue computation over metric algebras
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Computing Properties of Numerical Imperative Programs by Symbolic Computation
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Hi-index | 0.00 |
In the theory of computation on topological algebras there is a considerable gap between so-called abstract and concrete models of computation. In concrete models, unlike abstract models, the computations depend on the representation of the algebra. First, we show that with abstract models, one needs algebras with partial operations, and computable functions that are both continuous and many-valued. This many-valuedness is needed even to compute single-valued functions, and so abstract models must be nondeterministic even to compute deterministic problems. As an abstract model, we choose the "while"-array programming language, extended with a nondeterministic "countable choice" assignment, called the WhileCC* model. Using this, we introduce the concept of approximable many-valued computation on metric algebras. For our concrete model, we choose metric algebras with effective representations. We prove:(1) for any metric algebra A with an effective representation α, WhileCC* approximability implies computability in α, and (2) also the converse, under certain reasonable conditions on A. From (1) and (2) we derive an equivalence theorem between abstract and concrete computation on metric partial algebras. We give examples of algebras where this equivalence holds.