Non-Turing Computers are the New Non-Euclidean Geometries

被引:0
|
作者
Hogarth, Mark [1 ]
机构
[1] Univ Glasgow, Dept Philosophy, Glasgow G12 8QQ, Lanark, Scotland
关键词
Hypercomputation; non-Turing; spacetime; Malament-Hogarth; Church-Turing; supertasks;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
It is argued that recent work on non-Turing computability suggests a picture of computability analogous to that of modern geometry, and that in this picture there is no fundamental (absolute) boundary between the computable and the uncomputable. If correct, a conjecture about this fictional boundary's precise location would merely reflect a misunderstanding. The Church-Turing thesis is just such a conjecture.
引用
收藏
页码:277 / 291
页数:15
相关论文
共 50 条