🚀 go-pugleaf

In article <GUTTMAN.90Jun12105623@darjeeling.mitre.org> guttman@mitre.org (Joshua D. Guttman) writes:
>In article <15421@dime.cs.umass.edu> yodaiken@freal.cs.umass.edu (victor yodaiken) writes:
>   This seems like an opportune time to put in a plug for the Primitive
>   Recursive arithmetic [1]. 
>   While this formal method has received little attention in the c.s.
>   community, it has numerous advantages over more widely known methods.
>
>But doesn't PRA have the intrinsic problem that it contains much too small a
>set of functions?  EG no "unbounded search" and other sources of partial
>recursive functions.  
>
>	Josh

Too small for what? I have yet to see an example of a proposed or
implemented digital computer that can actually compute an unbounded search,
and do not understand why a programming language would need to be able to
expressive functions that are not feasible.  The class of p.r. functions
is very large, and contains a great deal of number theory. It would be
interesting to hear of examples of functions that are not p.r. and are
objects of interest for a programming language.