共 50 条
- [3] CLASSES OF COMPLEXITY AND CLASSES OF SIGNALING COMPUTABLE FUNCTIONS DOKLADY AKADEMII NAUK SSSR, 1976, 226 (03): : 513 - 515
- [4] Absolutely non-effective predicates and functions in computable analysis THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007, 4484 : 595 - +
- [6] COMPLETENESS PROBLEMS IN CLASSES OF COMPUTABLE NAMED FUNCTIONS CYBERNETICS, 1988, 24 (04): : 456 - 466
- [7] CHARACTERIZING CLASSES OF FUNCTIONS COMPUTABLE BY QUANTUM PARALLELISM PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1991, 435 (1895): : 563 - 574
- [9] FORMULAS OF RESTRICTED PREDICATE CALCULUS DISTINGUISHING SOME CLASSES OF MODELS WITH SIMPLY COMPUTABLE PREDICATES DOKLADY AKADEMII NAUK SSSR, 1973, 210 (02): : 285 - 287