By Topic

IEEE Transactions on Electronic Computers

Issue 4 • Aug. 1964

Filter Results

Displaying Results 1 - 25 of 47
  • [Front cover]

    Publication Year: 1964, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (588 KB)
    Freely Available from IEEE
  • IEEE Computer Group

    Publication Year: 1964, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (97 KB)
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 1964, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (97 KB)
    Freely Available from IEEE
  • The Special Issue on Computer Languages Editorial

    Publication Year: 1964, Page(s):343 - 344
    Request permission for commercial reuse | PDF file iconPDF (1002 KB)
    Freely Available from IEEE
  • Summary of the Issue

    Publication Year: 1964, Page(s): 345
    Request permission for commercial reuse | PDF file iconPDF (180 KB)
    Freely Available from IEEE
  • The Syntax of Programming Languages-A Survey

    Publication Year: 1964, Page(s):346 - 353
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1675 KB)

    The syntactic rules for many programming languages have been expressed by formal grammars, generally variants of phrase-structure grammars. The syntactic analysis essential to translation of programming languages can be done entirely mechanically for such languages. Major problems remain in rendering analyzers efficient in use of space and time and in finding fully satisfactory formal grammars for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decision Problems of Phrase-Structure Grammars

    Publication Year: 1964, Page(s):354 - 362
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1562 KB)

    Phrase-structure grammars were first introduced and studied by Chomsky as devices for generating the sentences of a language. By means of increasingly heavy restrictions on the productions (rewriting rules), four types of grammars were singled out by Chomsky: type 0 (unrestricted), type 1 (context-dependent), type 2 (context-free), and type 3 (finite state). In this paper, a number of decision pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computer Interpretation of English Text and Picture Patterns

    Publication Year: 1964, Page(s):363 - 376
    Cited by:  Papers (67)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2733 KB)

    This paper considers a class of information sources consisting of text and pictures. The text is English language text appearing in scientific and technical documents. The picture sources are the largely schematic pictures that occur in the same class of documents. However, the discussion is broadened slightly to include other picture sources. For a tiny fragment of English, the paper shows how th... View full abstract»

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

    Publication Year: 1964, Page(s):377 - 381
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (911 KB)

    After tracing the history of the development of ALGOL this paper discusses its current status as a candidate for adoption as an international standard. The main features of the language are then described and an example of ALGOL programming is provided and explained. View full abstract»

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

    Publication Year: 1964, Page(s):382 - 385
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    The fundamental concepts of FORTRAN, the most widely used high-level, scientific programming language, are set forth and the significant characteristics are described in historical order from inception of FORTRAN in 1954 to the present time. The basic problem of how to get high quality programming from an-easy- to-write high-level language is emphasized. View full abstract»

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

    Publication Year: 1964, Page(s):386 - 394
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1306 KB)

    The purpose of this paper is to give an over-all view of the FORMAC language. FORMAC is an experimental programming system designed to permit the manipulation of mathematical expressions. The paper includes a brief description of the FORMAC language and samples of complete FORMAC programs. It should be noted that FORMAC is an experimental program, and that at the present time IBM has no intention ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • List Processing and Extension of Language Facility by Embedding

    Publication Year: 1964, Page(s):395 - 400
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1334 KB)

    There are two distinct (though not necessarily disjoint) types of language extension. The first is a syntactic extension, in which the class of expressions interpretable within a language is widened. The second is an extension of the functional domain in which operations not previously performable are added to the language. These extensions may be implemented by completely reprogramming the basic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SOLߞA Symbolic Language for General-Purpose Systems Simulation

    Publication Year: 1964, Page(s):401 - 408
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1087 KB)

    This paper illustrates the use of SOL, a general-purpose algorithmic language useful for describing and simulating complex systems. Such a system is described as a number of individual processes which simultaneously enact a program very much like a computer program. (Some features of the SOL language are directly applicable to programming languages for parallel computers, as well as for simulation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Formal Definition of SOL

    Publication Year: 1964, Page(s):409 - 414
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1132 KB)

    This paper gives a formal definition of SOL, a general-purpose algorithmic language useful for describing and simulating complex systems. SOL is described using meta-linguistic formulas as used in the definition of ALGOL 60. The principal differences between SOL and problem-oriented languages such as ALGOL or FORTRAN is that SOL includes capabilities for expressing parallel computation, convenient... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Versatile Problem-Oriented Language for Engineers

    Publication Year: 1964, Page(s):415 - 421
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1165 KB)

    The language of DAS (Digital Analog Simulation) simplifies communication between an engineer and a digital computer. Typical applications range from evaluating design formulas to simulating air defense systems. Training time is about two hours. To describe a problem in DAS language, the engineer first sketches a block diagram of the problem, using blocks describable by single words of the DAS voca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Logic Design Translator Experiment Demonstrating Relationships of Language to Systems and Logic Design

    Publication Year: 1964, Page(s):422 - 430
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (991 KB)

    The original work on Logic Design Translators was motivated by the realization that it is possible to automate, to a certain degree, the repetitious and time-consuming process of developing logic equations for digital computers. In this paper, the linguistic basis for the system is discussed. An experiment which explains the translation process is also presented. The translator resembles closely a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aspects of Language Design for Combinatorial Computing

    Publication Year: 1964, Page(s):431 - 438
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1596 KB)

    Experience in the area of combinatorial computing acquired by the Maniac group at Los Alamos has motivated language development in this direction. Features incorporated into the MADCAP language to aid in programming combinatorial calculations include notation for set synthesis and analysis, notation for variably nested iterations (backtracking) and notation for complex conditional statements. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Formal Language for Describing Machine Logic, Timing, and Sequencing (LOTIS)

    Publication Year: 1964, Page(s):439 - 448
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1966 KB)

    An informal description of the LOTIS language is presented. LOTIS is intended for formally describing the logical structure, the sequencing, and the timing of digital machines. An effort has been made to produce a hardware notation that is convenient and lucid, precise and flexible. In a LOTIS machine description, every linguistic constituent corresponds to a unique machine element. Timing can be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Procedure-Oriented Machine Language

    Publication Year: 1964, Page(s):449 - 455
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1286 KB)

    A study of the general area of problem solving with a digital computer has revealed characteristics of data that are essentially ignored or suppressed in conventional systems. In an attempt to increase the capability and flexibility of a digital system, a new, high-level language, which utilizes these data characteristics has been defined. A machine organization, which implements this language as ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A FORTRAN Extension to Facilitate Proposal Preparation

    Publication Year: 1964, Page(s):456 - 462
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1421 KB)

    As an experiment in problem-oriented computer languages a system was developed to aid applications engineers in composing text for equipment proposals to customers. Building the proposal writer system around FORTRAN II enabled the system to be completed quickly and with modest effort. The use of the system is still considered experimental; however, the language is presented in the belief that it q... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Number of Transitions Entering the States of a Finite Automaton

    Publication Year: 1964, Page(s):463 - 464
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (471 KB)

    In recent years adaptive threshold ele-ments have been used as the basis for learning machines such as the Perceptron [1] and Adaline [2]. To the author's knowledge there has been no previously reported work on a systematic study of algorithms, used in learning machines, to modify the weightvalues of threshold elements. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effects of Adaptation Parameters on Convergence Time and Tolerance for Adaptive Threshold Elements

    Publication Year: 1964, Page(s):465 - 468
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (871 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.
  • Construction of Irredundant Multilevel Switching Functions

    Publication Year: 1964, Page(s):468 - 470
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 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.
  • Numerical Procedures for Boolean Function Minimization

    Publication Year: 1964, Page(s): 470
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (247 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.
  • A Method to Increase the Accuracy of Fast-Serial-Parallel Analog-to-Digital Converters

    Publication Year: 1964, Page(s):471 - 473
    Cited by:  Papers (7)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (469 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.

Aims & Scope

This Transactions ceased publication in 1967. The current retitled publication is 

IEEE Transactions on Computers.

Full Aims & Scope