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

共 12 条

[1]

Althöfer I, 2003, LECT NOTES COMPUT SC, V2883, P142

[2]

ALTHOFER I, 1985, DREIHIRN ENTSCHEIDUN, P20

[3]

[Anonymous], 2003, RECOMB 03, DOI DOI 10.1145/640075.640099

[4]

[Anonymous], 1987, THEORY RECURSIVE FUN

[5]

Brand M, 2004, LECT NOTES COMPUT SC, V3153, P106

[6]

GOLDIN D, 1998, CS9807 BROWN U DEP C

[7]

HEMPEL H, ASPECTS PERSIS UNPUB

[8]

Klan GW, 2002, EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS, P41

[9]

KOSUB S, 1998, 217 J MAX U WURZB I

[10]

LESH N, 2003, TR200305 MITS EL RES

← 1 2 →