[Haskell-cafe] More on performance
a.biurvOir4 at asuhan.com
Thu Jun 5 14:36:04 EDT 2008
Jon Harrop wrote:
> On Wednesday 04 June 2008 11:05:52 Luke Palmer wrote:
>> Given unbounded time and space, you will still arrive at the same result
>> regardless of the complexity.
> Given that the set of computers with unbounded time and space is empty, is
> not fruitless to discuss its properties?
The set of omnipotent people is also empty. That has not stopped
homo sapiens from discussing /its/ properties. All history is ever
only such a discussion for nothing fires up the imagination nor
provokes acts of brilliant foolhardiness like the unattainable.
View this message in context: http://www.nabble.com/More-on-performance-tp17629453p17676772.html
Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.
More information about the Haskell-Cafe