On Thu, 4 Feb 2016 15:03:12 -0600, Joel C. Ewing wrote: > >Except for implementation limits on storage and array sizes, finite >external file space, and practical limitations on execution time, >programming languages like FORTRAN, COBOL, PL/I, Algol, Ada, etc. could >all be used to program a Universal Turing Machine and in theory solve >any computable problem, so you could envision these languages as all >having a some degree of functional equivalency. Without loops, decent >conditional logic, arrays, or reasonable variable types JCL is unable to >play in that league. There is a good reason why JCL is not normally >regarded as a "Programming" language. > JCL may be halfway there. Recursion is equivalent in computational power to iteration. Since lately JCL PROC calls can be nested, recursion should be possible, albeit with a severe " implementation limit". The half entirely missing is conditional logic in the converter.
-- gil ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [email protected] with the message: INFO IBM-MAIN
