METHODS USED FOR PROBLEM SOLUTION WITH UNIVERSAL COMPUTER SYSTEMS,

Abstract

It is assumed that the algorithm is written in the form of a finite string composed of a given set of operators, left and right curved brackets, and predicates. A universal computing system consists of units each possessing a maximum volume of stored information and a maximum number of realizable operations in its repertoire. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jan 17, 1968
Accession Number
AD0678777

Entities

People

  • Yu. G. Kosarev

Organizations

  • National Air and Space Intelligence Center

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computers
  • Computing Devices

Fields of Study

  • Mathematics

Readers

  • Computational Linguistics
  • Computer Science/Computer Engineering/Data Science/Digital Signal Processing.
  • Structural Dynamics.