A network model of analogue computation over metric algebras

Authors:
John V. Tucker;Jeffery I. Zucker
Affiliations:
Department of Computer Science, University of Wales Swansea, Swansea, UK;Department of Computing & Software, McMaster University, Hamilton, Ontario, Canada
Venue:
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Year:
2005

Citing 7
Cited 1

Recursion theory on the reals and continuous-time computation

Theoretical Computer Science - Special issue on real numbers and computers
Signals & systems (2nd ed.)

Signals & systems (2nd ed.)
Computable analysis: an introduction

Computable analysis: an introduction
Analog and Hybrid Computing

Analog and Hybrid Computing
Analog computers and recursive functions over the reals

Journal of Complexity
Abstract versus concrete computation on metric partial algebras

ACM Transactions on Computational Logic (TOCL)
Real recursive functions and their hierarchy

Journal of Complexity

Can Newtonian systems, bounded in space, time, mass and energy compute all functions?

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a general concept of a network of analogue modules connected by channels, processing data from a metric space A, and operating with respect to a global continuous clock T.