On Mon, 11 Nov 2024 00:21:21 +0000, Seymour J Metz wrote: >Turing complete? > Requires infinite storage, otherwise some computable functions will fail for resource exhaustion.
>From: Phil Smith III >Sent: Sunday, November 10, 2024 7:16 PM > ... >Does it have to have loops? Variables? > LISP 1.0 had neither. -- gil ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [email protected] with the message: INFO IBM-MAIN
