(fetzer)aiee

Artificial Intelligence and Effective Epistemology,
by Kevin T. Kelly

p 319
In computational theory, a problem is just a mathematical function. A
program solves a problem (function) just in case it computes it. So the
natural order of business in computational theory is to define a function
extensionally, and to decide whether it is computable or not, how impossible
it is to compute [or] how long it takes to compute.

automatically generated by info2www version 1.2.2.8