Re: Recursion & Reflection -- & Rewrite
Jon Awbrey <[email protected]>
| Newsgroups | gmane.comp.inquiry |
|---|---|
| Message-ID | <[email protected]> |
Re: Joel Isaacson At: https://hermes.gwu.edu/cgi-bin/wa?A2=ind1011&L=cybcom&F=&S=&P=5126 In language used for inductive proofs -- of which recursive programs are the computational cousins -- the Base is the arbitrary or irregular data, the aggregate of which makes up a data base, and the Step is the regular procedure repeated up the ladder, the code that forms the program proper. When we come to interactive programs, whose bases encompass data that is read from the environment on a recurring basis, our initial notion of a base as an initial condition becomes broadened to a base as a boundary condition that is open-ended and extends forward in time. Jon Awbrey -- inquiry list: http://stderr.org/pipermail/inquiry/ mwb: http://www.mywikibiz.com/Directory:Jon_Awbrey knol: http://knol.google.com/k/-/-/3fkwvf69kridz/1 oeiswiki: http://www.oeis.org/wiki/User:Jon_Awbrey