Re: Recursion & Reflection
Jon Awbrey <[email protected]>
| Newsgroups | gmane.comp.inquiry |
|---|---|
| Message-ID | <[email protected]> |
One of Friday's notes was written under distraction, so let me try a bit of Monday morning quarterhacking: 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 interactive programs, whose bases include data that is read from the environment on a recurring basis, our first notion of a base as an initial condition is broadened to a base as a boundary condition that is open-ended and extends forward in time. Jon Awbrey P.S. If no one minds, I'll copy these notes to one of my archive sites, as I otherwise start to lose track of my train of thought after a while. cc: Inquiry List @ http://stderr.org/pipermail/inquiry/ -- 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