Handbook of logic in computer science (vol. 4)
Concrete models of computation for topological 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
Classical physics and the Church--Turing Thesis
Journal of the ACM (JACM)
Abstract versus concrete computation on metric partial algebras
ACM Transactions on Computational Logic (TOCL)
Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
Theoretical Computer Science
Rule-based analysis of dimensional safety
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Limits to measurement in experiments governed by algorithms†
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
By experimental computationwe mean the idea of computing a function by experimenting with some physical equipment. To analyse the functions computable by experiment, we are developing a methodology that chooses a precise specification of a physical theory Tand derives precise descriptions of the procedures and equipment the theory allows. As a case study, we choose a fragment Tof Newtonian kinematics and describe a language EP(T), and some of its extensions, for expressing experimental proceduresallowed by T. The languages for experimental procedures are similar to imperative programming languages that express algorithmic procedures. We show that EP(T) can define all functions on the rational numbers that are definable by algorithms.