STATE COMPLEXITY OF TURING MACHINES

被引：1
|
作者：
SCHMITT, AA
机构：
来源：
INFORMATION AND CONTROL | 1970年 / 17卷 / 03期
关键词：
D O I：
10.1016/S0019-9958(70)90440-7
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：217 / &
相关论文
共 50 条
  • [1] Verifying time complexity of Turing machines
    Gajser, David
    THEORETICAL COMPUTER SCIENCE, 2015, 600 : 86 - 97
  • [2] COMPUTATIONAL COMPLEXITY OF PROBABILISTIC TURING MACHINES
    GILL, J
    SIAM JOURNAL ON COMPUTING, 1977, 6 (04) : 675 - 695
  • [3] Verifying Time Complexity of Turing Machines
    Gajser, David
    INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2016, 40 (03): : 369 - 370
  • [4] The complexity of small universal turing machines
    Woods, Damien
    Neary, Turlough
    COMPUTATION AND LOGIC IN THE REAL WORLD, PROCEEDINGS, 2007, 4497 : 791 - +
  • [5] On relationships between complexity classes of Turing machines
    V. N. Zakharov
    V. A. Kozmidiadi
    Computational Mathematics and Mathematical Physics, 2017, 57 : 726 - 738
  • [6] ON REVERSAL COMPLEXITY FOR ALTERNATING TURING-MACHINES
    LISKIEWICZ, M
    LORYS, K
    30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 618 - 623
  • [7] On relationships between complexity classes of Turing machines
    Zakharov, V. N.
    Kozmidiadi, V. A.
    COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2017, 57 (04) : 726 - 738
  • [8] TURING-MACHINES AND COMPUTATIONAL-COMPLEXITY
    MARION, B
    AMERICAN MATHEMATICAL MONTHLY, 1994, 101 (01): : 61 - 65
  • [9] The Complexity of Small Universal Turing Machines: A Survey
    Neary, Turlough
    Woods, Damien
    SOFSEM 2012: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2012, 7147 : 385 - +
  • [10] The complexity of small universal Turing machines: A survey
    Woods, Damien
    Neary, Turlough
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (4-5) : 443 - 450
12345