计算机科学
图灵
通用图灵机
图灵机
描述号
图灵机示例
超递归算法
非确定性图灵机
作者
Petrus H. Potgieter,Elemér E. Rosinger
标识
DOI:10.1007/978-3-540-85194-3_18
摘要
We consider several kinds of non-finitary computation, using ordinary Turing machines, as usual, as the reference case. The main problem which this short paper tries to address, is the problem of defining the output, or final message, of a machine which has run for a countably infinite number of steps. A modest scheme, using non-standard numbers, is proposed.
科研通智能强力驱动
Strongly Powered by AbleSci AI