Advertisement

Research and Advances

report on CCITT data communications study group meeting

Data communications was the subject of a two-week meeting held 24 September through 4 October 1963, in Geneva, Switzerland, by the International Telegraph and Telephone Consultative Committee (CCITT) Special Study Group A. Previous meetings of this group had been held in Geneva in April, 1960, and October, 1961. The CCITT has traditionally been responsible for all standardization activities involving the public telecommunications network of the world. Among the 150 participants, there were eleven USA representatives who represented the Government, various business machine companies and the common carriers.
Research and Advances

Summary remarks

The topics began with discussion of almost exclusively syntactic analysis and methods. Beginning with context-free phrase-structure languages, we considered limitations thereof to remove generative syntactic ambiguities (Floyd), and extensions thereto to introduce more context-dependence (Rose). As the conference proceeded we ran through a spectrum of considerations in which the expressions in the languages considered were examined less and less as meaningless objects (the formal, or purely syntactic approach, as in the paper by Steel) and required more and more meaningful interpretations. In other words, we became more and more involved with semantic considerations. It is clear, then, that applications of the study of mechanical languages to programming must involve semantic questions; ADD must mean something more than the concatenation of three (not two) characters. The papers beyond Session 1 were therefore discussing the mechanization of semantics, but in only one case did we hear about the formalization (and hence mechanization) of the specification of the semantics of a language (McCarthy).
Research and Advances

American standard code for information interchange

There was the germ of an idea in two previous papers [1, 2] which no one seems to have picked up in almost five years. For certain functions it seems desirable to transform the argument to a short range symmetric about 1.0. I will give examples of this usage for the square root and logarithm function for both binary and decimal machines.

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved