|
|
|
Publications in Math-Net.Ru |
Citations |
|
1975 |
| 1. |
R. I. Freidson, “Finite approximation approach to investigation of the complexity of recursive predicates”, Zap. Nauchn. Sem. LOMI, 49 (1975), 131–158    |
|
1974 |
| 2. |
R. I. Freidson, “Table approximations to recursive predicates”, Zap. Nauchn. Sem. LOMI, 40 (1974), 131–135 |
|
1972 |
| 3. |
R. I. Freidson, “Families of the recursive predicates of the zero measure”, Zap. Nauchn. Sem. LOMI, 32 (1972), 121–128 |
1
|
|
1971 |
| 4. |
R. I. Freidson, “Regular approximations to the recursive predicates”, Zap. Nauchn. Sem. LOMI, 20 (1971), 220–233 |
|
1970 |
| 5. |
R. I. Freidson, “A certain characterization of the complexity of recursive predicates”, Trudy Mat. Inst. Steklov., 113 (1970), 79–101 ; Proc. Steklov Inst. Math., 113 (1970), 91–117 |
2
|
|
1968 |
| 6. |
R. I. Freidson, “A complexity characteristic of recursive predicates, which does not depend on standardization of the notion of algorithm”, Zap. Nauchn. Sem. LOMI, 8 (1968), 225–233 |
|
1967 |
| 7. |
R. I. Freidson, “Representation of recursive predicates by Rabin's machines”, Zap. Nauchn. Sem. LOMI, 4 (1967), 209–218 |
| |
|
|
Contact us: