Logical Approaches to Computational Barriers

Computing with Newtonian machines

Speaker:
| Edwin Beggs |

Author(s): |
Edwin Beggs and John V Tucker |

Slot: |
Array, 10:30-10:50, col. 3 |

The talk will consider to what extent machines operating under Newton's laws can compute more than a Turing machine. Various examples will be given, and their advantages and drawbacks discussed. The examples will be studied using a methodology to analyse and classify the physical sub-theories allowing the computations and hyper-computations. The work is part of our programme to discover just what pieces of classical mechanics are necessary ensure that machines can only compute what a Turing machine can compute.

websites: Arnold Beckmann | 2006-06-09 |