Persistent computations of Turing machines

被引：0
|
作者：
Hempel, Harald [1 ]
Kimmritz, Madlen [2 ]
机构：
[1] Univ Jena, Inst Informat, D-07743 Jena, Germany
[2] Univ Kiel, Math Seminar, D-24098 Kiel, Germany
来源：
IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS | 2008年 / 5148卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we formally define the notion of persistent Turing machines to model interactive computations. We compare the power of persistent computations with their classical counterparts.
引用
收藏
页码：171 / +
页数：2
相关论文
共 50 条
  • [1] Quantum Turing Machines: Computations and Measurements
    Guerrini, Stefano
    Martini, Simone
    Masini, Andrea
    APPLIED SCIENCES-BASEL, 2020, 10 (16):
  • [2] INFERENCE OF TURING MACHINES FROM SAMPLE COMPUTATIONS
    BIERMANN, AW
    ARTIFICIAL INTELLIGENCE, 1972, 3 (02) : 181 - 198
  • [3] On Turing Machines Deciding According to the Shortest Computations
    Manea, Florin
    AXIOMS, 2021, 10 (04)
  • [4] Persistent Turing Machines as a model of interactive computation
    Goldin, DQ
    FOUNDATIONS OF INFORMATION AND KNOWLEDGE SYSTEMS, 2000, 1762 : 116 - 135
  • [5] TURING-MACHINES WITH FEW ACCEPTING COMPUTATIONS AND LOW SETS FOR PP
    KOBLER, J
    SCHONING, U
    TODA, S
    TORAN, J
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1992, 44 (02) : 272 - 286
  • [6] A computational model of computer worms based on persistent turing machines
    Hao, Jingbo
    Yin, Jianping
    Zhang, Boyun
    PROCEEDINGS OF THE FIFTH IEEE INTERNATIONAL CONFERENCE ON COGNITIVE INFORMATICS, VOLS 1 AND 2, 2006, : 453 - 456
  • [7] Turing computations on ordinals
    Koepke, P
    BULLETIN OF SYMBOLIC LOGIC, 2005, 11 (03) : 377 - 397
  • [8] Modeling viral agents and their dynamics with persistent Turing machines and cellular automata
    Hao, Jingbo
    Yin, Jianping
    Zhang, Boyun
    AGENT COMPUTING AND MULTI-AGENT SYSTEMS, 2006, 4088 : 690 - 695
  • [9] Blind Turing-Machines: Arbitrary Private Computations from Group Homomorphic Encryption
    Rass, Stefan
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2013, 4 (11) : 47 - 56
  • [10] Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms
    Burgin, Mark
    Eberbach, Eugene
    FUNDAMENTA INFORMATICAE, 2009, 91 (01) : 53 - 77
12345