Barzdiņš Jānis Martynovich

Publications in Math-Net.Ru

1. The frequency solution of the problem of occurrence in a recursively enumerable set
   
   Trudy Mat. Inst. Steklov., 133 (1973),  52–58
2. On the prediction of general recursive functions
   
   Dokl. Akad. Nauk SSSR, 206:3 (1972),  521–524
3. Complexity and accuracy of the solution of initial segments of the problem of occurrence in a recursively enumerable set
   
   Dokl. Akad. Nauk SSSR, 199:2 (1971),  262–264
4. Frequency solution of algorithmically unsolvable queueing problems
   
   Dokl. Akad. Nauk SSSR, 191:5 (1970),  967–970
5. Deciphering of sequential networks in the absence of an upper limit on the number of states
   
   Dokl. Akad. Nauk SSSR, 190:5 (1970),  1048–1051
6. Computability on probabilistic machines
   
   Dokl. Akad. Nauk SSSR, 189:4 (1969),  699–702
7. Complexity of programs which recognize whether natural numbers not exceeding $n$ belong to a recursively enumerable set
   
   Dokl. Akad. Nauk SSSR, 182:6 (1968),  1249–1252
8. Capacity of medium and the behaviour of automata
   
   Dokl. Akad. Nauk SSSR, 160:2 (1965),  302–305
9. Universality problems in the theory of growing automata
   
   Dokl. Akad. Nauk SSSR, 157:3 (1964),  542–545
10. Universal pulsating elements
    
    Dokl. Akad. Nauk SSSR, 157:2 (1964),  291–294
11. On a class of Turing machines (Minsky's machines)
    
    Algebra i Logika. Sem., 1:6 (1963),  42–51


12. Boris Abramovich Trakhtenbrot (on the centenary of his birth)
    
    Uspekhi Mat. Nauk, 77:1(463) (2022),  191–195