On Thu, 6 Jun 2013 06:28:51 -0400, Shmuel Metz (Seymour J.) wrote: > >The PL/I macro preprocessor is Turing complete. > Presuming what infinite storage, which is a requirement for Turing completeness?
If you rely on arrays, you must exempt any restriction on subscript size/representation. If you rely on associative arrays, you must exempt any restriction on key size. Etc. -- gil ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [email protected] with the message: INFO IBM-MAIN
