Problem of theoretical way of finding an optumal computer performanse with minimal cost

concerning the problem of March 10

Problem of language specification in graph form

on sets of regular events with regards to Glushkov's paper

on predicate calcucus

on the equivalence of normal algorithms

on forming of topological platforms of control systems in random nets

titled "General problems"

Problem of existence of computational process equivalent to any operator algorithm

on the algorithm for graph-coloring problem

Problem of relations system based on the information from operator scemata

on complete system of transformatios for graph schemata and parallel computational processes

on introducton of computability relation in O-schemata

Completeness problem for partial trigger functions

of three problems for consideration

"Probleatical Recreations" - a gift from V.Kotov

of the idea of development of universal fragmentary language

on ideal system programming language