Advertisement

Author Archives

Research and Advances

Towards standards for handwritten zero and oh: much ado about nothing (and a letter), or a partial dossier on distinguishing between handwritten zero and oh

The Chairman of the ACM Standards Committee, Julien Green, has charged me with making “more effective use of CACM for communication … to get grass-roots opinions from the ACM membership.” This paper is the first attempt. A partial dossier on distinguishing between handwritten zero and the letter oh is assembled here. This presentation was triggered by a request for guidance in this matter presented by the United Kingdom Delegation to ISO/TC97/SC2, Character Sets and Coding, at the meeting in Paris on 1967 March 13-16. The matter is just now in the province of USASI X3.6, to which comments might be directed. Comments will be expected within sixty days [by approximately October 1st].
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

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.
Research and Advances

A note on range transformations for square root and logarithm

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