超计算

**超計算**或**超圖靈計算**可以輸出非圖靈可計算結果的計算模型。例如，一台可以解決停機問題的機器可算作一台超計算機；可以正確推演皮亞諾算術中每一個狀態的機器亦然。

邱奇－圖靈論題指出，任何可以用有限算法以紙筆計算的 "可有效計算" 函數都能被圖靈機計算。超計算機能計算圖靈機無法計算、即邱奇－圖靈論題中不可計算的的函數。

嚴格說來概率圖靈機的輸出是不可計算的。然而，大多數超計算方向的文獻更關注有用的計算而非隨機、不可計算的函數。

## 擴展閱讀

* Mario Antoine Aoun, "Advances in Three Hypercomputation Models （頁面存檔備份，存於網際網路檔案館）", (2016)
* L. Blum, F. Cucker, M. Shub, S. Smale, _Complexity and Real Computation_, Springer-Verlag 1997. General development of complexity theory for abstract machines that compute on real numbers instead of bits.
* Burgin, M. S. (1983) Inductive Turing Machines, _Notices of the Academy of Sciences of the USSR_, v. 270, No. 6, pp. 1289–1293
* Keith Douglas. _Super-Turing Computation: a Case Study Analysis （頁面存檔備份，存於網際網路檔案館）_ (PDF), M.S. Thesis, Carnegie Mellon University, 2003.
* Mark Burgin (2005), _Super-recursive algorithms_, Monographs in computer science, Springer. ISBN 0-387-95569-0
* Cockshott, P. and Michaelson, G. Are there new Models of Computation? Reply to Wegner and Eberbach, _The computer Journal_, 2007
* Cooper, S. B. Definability as hypercomputational effect (PDF). Applied Mathematics and Computation. 2006, **178**: 72–82 [2017-12-20]. doi:10.1016/j.amc.2005.09.072. （原始內容 (PDF) 存檔於 2011-07-24）.
* Cooper, S. B.; Odifreddi, P. Incomputability in Nature. S. B. Cooper and S. S. Goncharov (編). Computability and Models: Perspectives East and West (PDF). Plenum Publishers, New York, Boston, Dordrecht, London, Moscow. 2003: 137–160 [2017-12-20]. （原始內容 (PDF) 存檔於 2011-07-24）.
* Copeland, J. (2002) _Hypercomputation_, Minds and machines, v. 12, pp. 461–502
* Davis, Martin (2006), "The Church–Turing Thesis: Consensus and opposition". Proceedings, Computability in Europe 2006. _The requested URL /~simon/TEACH/28000/DavisUniversal.pdf was not found on this server._ Lecture Notes in Computer Science, 3988 pp. 125–132
* Hagar, A. and Korolev, A., _Quantum Hypercomputation—Hype or Computation? （頁面存檔備份，存於網際網路檔案館）_ , (2007)
* Müller, Vincent C. On the possibilities of hypercomputing supertasks. Minds and Machines. 2011, **21** (1): 83–96 [2017-12-20]. doi:10.1007/s11023-011-9222-6. （原始內容存檔於 2017-12-22）.
* Ord, Toby. _Hypercomputation: Computing more than the Turing machine can compute_ （頁面存檔備份，存於網際網路檔案館）: A survey article on various forms of hypercomputation.
* Piccinini, Gualtiero: _Computation in Physical Systems_ （頁面存檔備份，存於網際網路檔案館）
* Putz, Volkmar and Karl Svozil, _Can a computer be "pushed" to perform faster-than-light? （頁面存檔備份，存於網際網路檔案館）_ , (2010)
* Rogers, H. (1987) Theory of Recursive Functions and Effective Computability, MIT Press, Cambridge Massachusetts
* Mike Stannett, Mike. X-machines and the halting problem: Building a super-Turing machine. Formal Aspects of Computing. 1990, **2** (1): 331–341. doi:10.1007/BF01888233.
* Mike Stannett, _The case for hypercomputation_, Applied Mathematics and Computation, Volume 178, Issue 1, 1 July 2006, Pages 8–24, Special Issue on Hypercomputation
* Syropoulos, Apostolos (2008), _Hypercomputation: Computing Beyond the Church–Turing Barrier_ (preview （頁面存檔備份，存於網際網路檔案館）), Springer. ISBN 978-0-387-30886-9
* Turing, Alan. Systems of logic based on ordinals. Proceedings of the London Mathematical Society. 1939, **45**: 161–228. doi:10.1112/plms/s2-45.1.161.

## 外部連結

* Hypercomputation Research Network （頁面存檔備份，存於網際網路檔案館）