Continuo da qui l'esplorazione dagli inizi del Lisp.
Continuo l'esame di Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I, sono giunto a Flowcharts and Recursion.
Since both the usual form of computer program and recursive function definitions are universal computationally, it is interesting to display the relation between them. The translation of recursive symbolic functions into computer programs was the subject of the rest of this report. In this section we show how to go the other way, at least in principle.
Semplifico al massimo, un programma può essere rappresentato in un flowchart come questo:
Given a flowchart with a single entrance and a single exit, it is easy to write down the recursive function that gives the transformation of the state vector from entrance to exit in terms of the corresponding functions for the computation blocks and the predicates of the branch.
Con qualche (non troppo ovvia manipolazione) [w]e then write
e quindi
Sì, sto svicolando 🤪 JMC conclude con ringraziamenti e bibliografia, per me è arrivato il momento di esaminare un altro documento.
🔴
Nessun commento:
Posta un commento