On time hierarchies
作者:
Highlights:
•
摘要
For fixed k ⩾ 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k ⩾ 2 we exhibit infinite hierarchies of languages recognizable by k-tape machines with machines with increasing amount of time on the same amount of space.
论文关键词:
论文评审过程:Received 13 July 1977, Revised 29 September 1978, Available online 2 December 2003.
论文官网地址:https://doi.org/10.1016/0022-0000(79)90028-X