Yes and you can multiply two 10 digit integers with a Turing machine. Theory says: anything that can be done with a Cray can be done
with a Turing machine (but not vice versa unless the Cray is provided with unlimited memory). Of course you have to be willing to
let the TM run for a few millennia.
But this kind of theory has nothing to do with Standards or with the charter of J3.
= Loren P Meissner
-----Original Message-----
From: James Giles [mailto:[log in to unmask]]
Sent: Sunday, February 22, 2004 9:48 PM
To: Fortran committee list
Subject: (j3.2004-508) Re: Fortran 20xx Request #Pub-121
[...] a rather important
proven theorem of computing science that functional and procedural
methods are equivalent and the rather famous hypothesis that there
are no computable functions beyond their common ability. Unless
you have invented a counterexample to the Church-Turing hypothesis,
ther is nothing you propose that can't already be done Fortran with
a suitable workaround.
--
J. Giles
|