By Topic

Annals of the History of Computing

Issue 1 • Date Jan.-March 1981

Filter Results

Displaying Results 1 - 13 of 13
  • About this issue

    Publication Year: 1981 , Page(s): 3
    Save to Project icon | Request Permissions | PDF file iconPDF (792 KB)  
    Freely Available from IEEE
  • Harold Locke Hazen, 1901-1980

    Publication Year: 1981 , Page(s): 4 - 12
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (11792 KB)  

    Harold L. Hazen, Dean Emeritus of the Graduate School at the Massachusetts Institute of Technology, who died in Belmont, Massachusetts, on February 21, 1980, was one of this country's early pioneers in the field of machine computation and automatic control. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Foreword [to Special Issue]

    Publication Year: 1981 , Page(s): 13
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | PDF file iconPDF (947 KB)  
    Freely Available from IEEE
  • Formal Languages: Origins and Directions

    Publication Year: 1981 , Page(s): 14 - 41
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (36796 KB)  

    Origins of the theory of formal languages and automata are surveyed starting from 1936 with the work of Turing and Post. Special attention is given to the machine translation projects of the 1950s and early 1960s and associated work in mathematical linguistics. The development of the Chomsky hierarchy of grammars, machines, and languages from 1956 to 1964 is traced. It is observed that the same important ideas emerged independently for the automatic analysis and translation of both natural and artificial languages. Since 1964, formal language theory is part of theoretical computer science. A few of the directions since 1964 are considered: restrictions and extensions of context-free grammars and pushdown store automata, unifying frameworks, and complexity questions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Observations About the Development of Theoretical Computer Science

    Publication Year: 1981 , Page(s): 42 - 51
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (12613 KB)  

    This paper gives a personal account of some early developments in automata theory and the initiation of research in computational complexity theory. Although the account is subjective and deals primarily with the research areas of direct interest to the author, It discusses the underlying beliefs and philosophy that guided this research as well as the intellectual environment and the Ideas and contacts that influenced it. An attempt is also made to draw some general conclusions about computer science research and to discuss the nature of theoretical computer science. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Origins of Recursive Function Theory

    Publication Year: 1981 , Page(s): 52 - 67
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (20563 KB)  

    For over two millenia mathematicians have used particular examples of algorithms for determining the values of functions. The notion of "?-definability" was the first of what are now accepted as equivalent exact mathematical descriptions of the class of the functions for which algorithms exist. This article explains the notion and traces the investigation in 1931-1933 by which the notion was quite unexpectedly so accepted. The Herbrand-Gödel notion of "general recursiveness" in 1934 and the Turing notion of "computability" in 1936 were the second and third equivalent notions. Techniques developed in the study of ?-definability were applied in the analysis of general recursiveness and Turing compatibility. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Meetings in Retrospect

    Publication Year: 1981 , Page(s): 68 - 71
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4771 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Anecdotes

    Publication Year: 1981 , Page(s): 72
    Save to Project icon | Request Permissions | PDF file iconPDF (1230 KB)  
    Freely Available from IEEE
  • News and Notices

    Publication Year: 1981 , Page(s): 72
    Save to Project icon | Request Permissions | PDF file iconPDF (1230 KB)  
    Freely Available from IEEE
  • Comments, queries, and debate

    Publication Year: 1981 , Page(s): 73
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (884 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reviews

    Publication Year: 1981 , Page(s): 74 - 75, 77, 79-80
    Save to Project icon | Request Permissions | PDF file iconPDF (7276 KB)  
    Freely Available from IEEE
  • Contributions to the Annals of the History of Computing

    Publication Year: 1981 , Page(s): 83 - 84
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2048 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Index to Volumes 1 and 2

    Publication Year: 1981 , Page(s): 85 - 109
    Save to Project icon | Request Permissions | PDF file iconPDF (1634 KB)  
    Freely Available from IEEE

Aims & Scope

From the analytical engine to the supercomputer, from Pascal to von Neumann, from punched cards to CD-ROMs -- Annals of the History of Computing covers the breadth of computer history.

 

This Periodical ceased publication in 1991. The current retitled publication is IEEE Annals of the History of Computing.

Full Aims & Scope