> On 19 Aug 2019, at 03:25, Russell Standish <[email protected]> wrote: > > On Sat, Aug 17, 2019 at 12:17:38PM +0200, Bruno Marchal wrote: >> >> You cannot identify a computation and a representation of that computation. >> So >> the answer is no: the blockhead or the infinite look-up table does not >> process >> a computation. > > That is incorrect. Lookup tables _are_ computations, and the algorithms > go by the name "memoisation", and are a form of optimisation where > space and time are traded.
Only for finite functions. An infinite look-up table is not an algorithm or machine. Programs, machines, algorithm are required to be finitely given. If we allow infinite look-up table, all functions from N to N becomes computable. Bruno > > > -- > > ---------------------------------------------------------------------------- > Dr Russell Standish Phone 0425 253119 (mobile) > Principal, High Performance Coders > Visiting Senior Research Fellow [email protected] > Economics, Kingston University http://www.hpcoders.com.au > ---------------------------------------------------------------------------- > > -- > You received this message because you are subscribed to the Google Groups > "Everything List" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > To view this discussion on the web visit > https://groups.google.com/d/msgid/everything-list/20190819012547.GD20075%40zen. -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/everything-list/4BB8E12C-6198-4EF6-8683-5131ABF34F22%40ulb.ac.be.
