Model structure, complexity, and algorithmic transparency in APL

DOI10.1016/0307-904X(91)90038-QMaRDI QIDQ1903271zbMATH OpenFDO

Authors W. E. Cundiff

Publication date 26 November 1995

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0307-904X(91)90038-Q

zbMATH Keywords

algorithmic transparencyAPLcomplex systems

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Parallel algorithms in computer science (68W10)

Recommendations

• Structural models of algorithms in problems of applied programming. I: Formal algorithmic structures
• Structural models of algorithms in problems of applied programming. II: Structural-algorithmic approach to software simulation
• scientific article; zbMATH DE number 1170464
• scientific article; zbMATH DE number 1822451
• A Directly Executable Encoding for APL

Cites work

• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• Language performance in computing table look-up auxiliaries on microcomputers
• Letters to the editor
• Simulating system dynamics in APL

Describes a project that uses

Uses Software

• APL

This page was built for publication: Model structure, complexity, and algorithmic transparency in APL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903271)