METHODS USED FOR PROBLEM SOLUTION WITH UNIVERSAL COMPUTER SYSTEMS,

reportActive / Technical Report | Accession Number: AD0678777 | Need Help?

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

Author(s):
Kosarev, Yu. G.
Author Organization(s):
FOREIGN TECHNOLOGY DIV WRIGHT-PATTERSON AFB OHIO
Supplementary Note:
Unedited rough draft trans. of Vychislitelnye Sistemy (USSR) n17 p61-69 1965.
Annotation:
Methods used for problem solution with universal computer systems--Translation.
Pagination:
0038

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
FTD-HT-23-1417-67
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
(*COMPUTER PROGRAMMING, *ALGORITHMS), DATA PROCESSING, SEQUENCES(MATHEMATICS), OPERATORS(MATHEMATICS), OPTIMIZATION, MATRICES(MATHEMATICS), PROBLEM SOLVING, MULTIPLE OPERATION, USSR
Field(s)/Group(s):
Computer Programming and Software
Keyword(s):
MULTIPROCESSING, TRANSLATIONS
Report Date:
1968 Jan 17