The Church-Turing Thesis and Timed Computations

This paper suggests that certain timed programs are mechanically computable, but not expressible in conventional models of computation such as Turing Machines, unless computational steps are assigmed a duration, but assigning durations to computations strictly extends conventional models of computation.

Extended abstract: ps.gz, pdf, Status: unpublished.

$Id: index.html,v 1.2 2004/09/22 19:59:47 martinb Exp $