A Talk With John Chowning

Lehrman, Paul
February 2005
Mix;Feb2005, Vol. 29 Issue 3, p28
Profiles music composer John Chowning in California. Career and personal background; Study and application of Algorithm Language, one of the first computer languages employing algebraic symbols; Knowledge about transferring computer data in a dual buffer arrangement.


Related Articles

  • Upgrade gives tester more diagnostics, languages. McLaughlin, Patrick // Cabling Installation & Maintenance;Jun2001, Vol. 9 Issue 7, p54 

    Presents an upgrade to the Micro-ztest OMNIScanner2 handheld cabling tester and the Scanlink Tools software. Use of the OMNIScanner2 for testing capabilities of product and language options; Function of proprietary algorithm to capture and count noise impulses of a magnitude affecting network...

  • Techniques for Algorithm Animation. Brown, Marc H. // IEEE Software;Jan85, Vol. 2 Issue 1, p28 

    Focuses on the techniques for algorithm animation in computer software programs in the United States. Description of Balsa system; Types of facilities used in Balsa; Availability of an electronic notebook about algorithm animation.

  • Experience Machines. Rossiter, Ned; Zehle, Soenke // Sociologia del Lavoro;2014, Issue 133, p111 

    In an economy that sees labour and life inseparable from informational technologies, their metrics and modes of organization, what is at stake is not only the political economy of online networking but the very constitution of political subjectivity - the autonomy of affect. As new algorithmic...

  • Incentive-compatible interdomain routing. Feigenbaum, Joan; Ramachandran, Vijay; Schapira, Michael // Distributed Computing;Apr2011, Vol. 23 Issue 5/6, p301 

    The routing of traffic between Internet domains, or Autonomous Systems (ASes), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP, Rekhter and Li in RFC 4271 of the Internet Engineering Task Force, ). Using BGP, ASes can apply semantically rich routing...

  • Accurate Optical Flow Based on Spatiotemporal Gradient Constancy Assumption. Rabcewicz, Adam // International Journal of Signal Processing;2008, Vol. 4 Issue 4, p273 

    Variational methods for optical flow estimation are known for their excellent performance. The method proposed by Brox et al. [5] exemplifies the strength of that framework. It combines several concepts into single energy functional that is then minimized according to clear numerical procedure....

  • Computing with the Cytoskeleton : A Problem of Scale. Glade, Nicolas // International Journal of Unconventional Computing;2008, Vol. 4 Issue 1, p33 

    Microtubules and actin filaments are dynamic fibres constituting the skeleton of living cells. They show seemingly computational behaviours. Indeed, depending on conditions of reaction, they self-organise into temporal and/or spatial morphologies in vitro and act as micro-machine processors and...

  • An elementary and unified approach to program correctness. Bohórquez V, Jaime // Formal Aspects of Computing;Sep2010, Vol. 22 Issue 5, p611 

    We present through the algorithmic language DHL (Dijkstra-Hehner language), a practical approach to a simple first order theory based on calculational logic, unifying Hoare and Dijkstra’s iterative style of programming with Hehner’s recursive predicative programming theory, getting...

  • Distributed state space minimization. Blom, Stefan; Orzan, Simona // International Journal on Software Tools for Technology Transfer;Jun2005, Vol. 7 Issue 3, p280 

    We present a new algorithm, and its distributed implementation, for reducing labeled transition systems modulo strong bisimulation. The base of this algorithm is the Kanellakis–Smolka “naive method”, which has a high theoretical complexity but is successful in practice and...

  • Algorithmic program synthesis: introduction. Bodik, Rastislav; Jobstmann, Barbara // International Journal on Software Tools for Technology Transfer;Oct2013, Vol. 15 Issue 5/6, p397 

    Program synthesis is a process of producing an executable program from a specification. Algorithmic synthesis produces the program automatically, without an intervention from an expert. While classical compilation falls under the definition of algorithmic program synthesis, with the source...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics