21 Jan
2002
21 Jan
'02
12:58 p.m.
Dear Category Theory list, I would like to know if anyone has any references regarding the use of the computation of Kan extensions as a model of computation (e.g. how powerful is some given algorithm as compared to a Turing machine). I have seen the Walters-Carmody algorithm in 'Categories and Computer Science', but there is no mention there of the computational power of the algorithm presented. Any information would be welcome. Yours, -- Robert Byrne 23-Jan-2002 08:39:46 -0400,4207;000000000001-00000000