Social network analysis widely uses graph techniques. Together with correct applications, in some cases, results are obtained from the graphs using paths longer than one, and due to intransitivity of relationships, several ...

Aprakstīts algoritmisks eksperiments, kas veikts ar nolūku pārliecināties, ka ļoti vienkārša, pat primitīva, bet būtiski paralelizēta, redzes datu primārā apstrāde ir pietiekoši spēcīga, lai tiktu detektētas svarīgas attēla ...

Prediction: f(m+1) is guessed from given f(0), ..., f(m). Program synthesis: a program computing f is guessed from given f(0), ..., f(m). The hypotheses are required to be correct for all sufficiently large m, or with some ...

The value f(m+1) is predicted from given f(1), ..., f(m). For every enumeration T(n, x) there is a strategy that predicts the n-th function of T making no more than log2(n) errors (Barzdins-Freivalds). It is proved in the ...

Darbs kvalificēts kā Kandidāta darbs, Konkursa darbs, iesniegts LŪ, Matēmatikas nodaļai 1933. g. 14. augustā. Stud. math. Emanuels Grünbergs, Matr. 14875. Motto "Patientia vincet." Disertācijā 143 lpp. Publicējam bez pilnā ...

Let T be a strong enough theory, and M - its metatheory, both are consistent. Then there is a closed arithmetical formula H that is undecidable in T, but one cannot prove in M neither that H is T-unprovable, nor that H is ...

The paper suggests an exhaustive search algorithm for finding Hamiltonian circuits in an undirected graph based on depth-first search and working successfully on sparse graphs. The method is based on the idea not to ...