ON THE OPERATING TIME OF ERRORLESS PROBABILISTIC TURING-MACHINES

被引：0

|

作者：

FREIVALD, RV

机构：

来源：

THEORY OF PROBABILITY AND ITS APPLICATIONS | 1988年 / 32卷 / 03期

关键词：

D O I：

10.1137/1132073

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

引用

收藏

页码：514 / 516

页数：3

相关论文

共 50 条

[31] UNBOUNDED HARDWARE IS EQUIVALENT TO DETERMINISTIC TURING-MACHINES
CHAZELLE, B
MONIER, L
THEORETICAL COMPUTER SCIENCE, 1983, 24 (02) : 123 - 130
[32] 2-WAY FINITE PROBABILISTIC-AUTOMATA AND TAPE-BOUNDED TURING-MACHINES
FREIVALD, RV
DOKLADY AKADEMII NAUK SSSR, 1981, 256 (06): : 1326 - 1329
[33] ARE MULTILAYER FEEDFORWARD NETWORKS EFFECTIVELY TURING-MACHINES
LEVELT, WJM
PSYCHOLOGICAL RESEARCH-PSYCHOLOGISCHE FORSCHUNG, 1990, 52 (2-3): : 153 - 157
[34] COMPLEXITY GAPS OF TURING-MACHINES ON INFINITE WORDS
TAIMINA, D
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 278 : 436 - 439
[35] SIMULATION OF TURING-MACHINES BY A REGULAR REWRITE RULE
DAUCHET, M
THEORETICAL COMPUTER SCIENCE, 1992, 103 (02) : 409 - 420
[36] FAST SIMULATION OF TURING-MACHINES BY RANDOM-ACCESS MACHINES
KATAJAINEN, J
VANLEEUWEN, J
PENTTONEN, M
SIAM JOURNAL ON COMPUTING, 1988, 17 (01) : 77 - 88
[37] TWO-DIMENSIONAL ALTERNATING TURING-MACHINES
INOUE, K
TAKANAMI, I
TANIGUCHI, H
THEORETICAL COMPUTER SCIENCE, 1983, 27 (1-2) : 61 - 83
[38] REAL FUNCTIONS AND NUMBERS DEFINED BY TURING-MACHINES
FREUND, R
THEORETICAL COMPUTER SCIENCE, 1983, 23 (03) : 287 - 304
[39] ON INPUT READ-MODES OF ALTERNATING TURING-MACHINES
CAI, LM
CHEN, JN
THEORETICAL COMPUTER SCIENCE, 1995, 148 (01) : 33 - 55
[40] QUANTUM-MECHANICAL HAMILTONIAN MODELS OF TURING-MACHINES
BENIOFF, P
JOURNAL OF STATISTICAL PHYSICS, 1982, 29 (03) : 515 - 546

← 1 2 3 4 5 →