Article View: comp.lang.functional
Article #305Re: Primitive Recursive Arithmetic
From: Frank Silbermann
Date: Thu, 14 Jun 1990 16:11
Date: Thu, 14 Jun 1990 16:11
17 lines
1275 bytes
1275 bytes
In article <15548@dime.cs.umass.edu> yodaiken@freal.cs.umass.edu (victor yodaiken) writes: >>>> But doesn't Primitive Recursive arithmetic >>>> contain much too small a set of functions? >>> Too small for what? I do not understand why a programming language >>> would need to be able to expressive functions that are not feasible. > What's an example of a function that is of real interest > and that cannot be expressed cleanly as a p.r. function? Could you write an interpreter for Horn clause logic programming (which is semi-decidable) as a primitive recursive function? On the otherhand, if you view primitive recursive functions as adequate for general programming, you _could_ reply that a Prolog interpreter is not of real interest! :-) Frank Silbermann fs@rex.cs.tulane.edu
Technical Details
Message-ID:
<3594@rex.cs.tulane.edu>Path:
arc1-ca.pugleaf.net!utzoo!attcan!uunet!cs.utexas.edu!mailrus!ames!rex!fsReferences:
<15421@dime.cs.umass.edu> <GUTTMAN.90Jun12105623@darjeeling.mitre.org> <15548@dime.cs.umass.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!cs.utexas.edu!mailrus!ames!rex!fs From: fs@rex.cs.tulane.edu (Frank Silbermann) Newsgroups: comp.lang.functional Subject: Re: Primitive Recursive Arithmetic Message-ID: <3594@rex.cs.tulane.edu> Date: 14 Jun 90 16:11:01 GMT References: <15421@dime.cs.umass.edu> <GUTTMAN.90Jun12105623@darjeeling.mitre.org> <15548@dime.cs.umass.edu> Organization: Computer Science Dept., Tulane Univ., New Orleans, LA Lines: 17