Vladimir Yakhnis

Learn More
The Linguistic Geometry (LG) approach to discrete systems was introduced by B. Stilman in early 80s. It employed competing/cooperating agents for modeling and controlling of discrete systems. The approach was applied to a variety of problems with huge state spaces including control of aircraft, battlefield robots, and chess. One of the key innovations of LG(More)
Goncharov, S., A. Yakhnis and V. Yakhnis, Some effectively infinite classes of enumerations, about the size of the class of positive elements of a Roger's semilattice. We introduce a notion of effective infinity of classes of computable enumerations. Then, using finite injury priority method, we prove five theorems which give sufficient conditions to be(More)
We dene a new type of two player game occurring on a tree. The tree may have no root and may have arbitrary degrees of nodes. These games extend the class of games considered by Gurevich-Harrington in [5]. We prove that in the game one of the players has a winning strategy which depends on nite bounded information about the past part of a play and on future(More)