Can Turing machines capture everything we can compute?
综合数学
2007-05-23 v2
摘要
If we define classical foundational concepts constructively, and introduce non-algorithmic effective methods into classical mathematics, then we can bridge the chasm between truth and provability, and define computational methods that are not Turing-computable.
关键词
引用
@article{arxiv.math/0304379,
title = {Can Turing machines capture everything we can compute?},
author = {Bhupinder Singh Anand},
journal= {arXiv preprint arXiv:math/0304379},
year = {2007}
}
备注
v2; introduced standardised ACI compliant notation for citations; 13 pages; an HTML version is available at http://alixcomsi.com/Can_Turing_machines.htm