Reversible space equals deterministic space (extended abstract)

被引：0
|
作者：
Lange, KJ
McKenzie, P
Tapp, A
机构：
来源：
TWELFTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS | 1997年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper describes the simulation of an S(n) space-bounded deterministic Turing machine by a reversible Turing machine operating in space S(n). It thus answers a question posed by Bennett in 1989 and refutes the conjecture, made by Li and Vitanyi in 1996, that any reversible simulation of an irreversible computation must obey Bennett's reversible pebble game rules.
引用
收藏
页码：45 / 50
页数：6
相关论文
共 50 条
12345