The Synthesis of Algorithmic Systems

  title={The Synthesis of Algorithmic Systems},
  author={Alan J. Perlis},
  journal={J. ACM},
  • A. Perlis
  • Published 1967
  • Computer Science
  • J. ACM
On what does the fame of Turing rest? That he proved a theorem showing that for a general computing device later dubbed a "Turing machine" -there existed functions which it could not compute? I doubt it. More likely it is because of the model he invented and employed: his formal mechanism. This~ model has captured the imagination and mobilized the thoughts of a generation Of scientists. It has provided a base for arguments leading to theories. His model has proved so useful that its generated… 
A Data Definition Facility for Programming Languages
  • T. Standish
  • Computer Science
    Outstanding Dissertations in the Computer Sciences
  • 1967
This dissertation presents a descriptive notation for data structures which is embedded in a programming language in such a way that the resulting language behaves as a synthetic tool for describing
Algorithmic systems: the consent is in the detail?
This article examines the transformation of consent models in order to assess how the concept and the applied models of consent can be reconciled so as to correspond not only to the current regulatory landscapes but also to the exponential growth of algorithmic processing technologies.
A Model for Evaluating Algorithmic Systems Accountability
A model for evaluating how transparent algorithms are by focusing on their algorithmic part as well as the maturity of the organizations that utilize them was applied on a classification algorithm created and utilized by a large financial institution.
Parallel computation using active self-assembly
The nubots model of molecular-scale self-assembly generalises asynchronous cellular automata to have non-local movement where large assemblies of molecules can be moved around, analogous to millions of molecular motors in animal muscle effecting the rapid movement of macroscale arms and legs, and is shown to be a highly parallel model of computation in a formal sense.
Formalizing Game-play
The article suggests a formalism for describing not just the game map and playing pieces but also all the game rules including the “sequence of play” and shows a complete specification of a simple, but complicated enough for present purposes, “introductory” board wargame.
A Bibliography of the ACM Turing Awards (1966–date)
A. [111, 81]. Abstraction [45]. ACM [136, 127, 120, 134, 83, 91, 137, 82, 90, 115, 119, 70, 113, 95]. Age [125]. Agenda [113]. AI [128]. Alan [118, 103]. Algebra [11, 25]. Algorithm [62, 63].
How to: Cope with C++ Environments
In this How to I’ll provide some guidance on using compilers and IDEs (Integrated Development Environments).
How to: Overload Operators
The guidelines in this How to do not necessarily result in the most efficient code from an execution standpoint, but development efforts are minimized while efficiency and maintainability from a coding standpoint are emphasized.
How to: Understand and Use Standard Libraries
This book uses some of the ideas from STL, the Standard Template Library, for example in the class tvector and in the sorting functions of sortall.h.