🚀 go-pugleaf

In article <22132@megaron.cs.arizona.edu> gudeman@cs.arizona.edu (David Gudeman) writes:
>In article  <15548@dime.cs.umass.edu> yodaiken@freal.cs.umass.edu (victor yodaiken) writes:
>>
>>This is a common argument, but I'd like to see something a little more
>>concrete. What's an example of a function that is of real interest
>>to a programmer, and that cannot be  expressed cleanly as a p.r. function.
>
>How about eval(P) to execute a program P in some more powerful language?
>-- 
>					David Gudeman
>Department of Computer Science
>The University of Arizona        gudeman@cs.arizona.edu
>Tucson, AZ 85721                 noao!arizona!gudeman


1. Not a very concrete example. Why do we need the more powerful language?
The question here is whether or not we need non-p.r. functions to
write programs? 

2. We can easily write eval_{k,C}(P) where 
eval_{k,C} must complete within  AckermansFunction(k,C*Length(P)) 
steps. If we cannot write such a function, then is eval(P) feasible?