تحسيب فائق

التحسيب الفائق (الإنكليزية: Hypercomputation) هومصطلح يشير إلى نماذج التحسيب المتنوعة عن آلة تورنگ. هذا يتضمن الكثير من طرق التحسيب النظرية للتوابع الغير قابلة للتحسيب وفق آلة تورنگ باستخدام خوارزميات عودية فائقة super-recursive algorithm (انظر مهمة فائقة). وهويضم أيضاً أشكالاً عديدة من التحسيب، كالتحسيب التفاعلي. استخدم المصطلح لأول مرة من عام 1999 من قبل جاك كوبلاند Jack Copeland وديان برودفوت Diane Proudfoot.

انظر أيضاً

Church-Turing thesis
Malament-Hogarth spacetime
Oracle machine
Zeno machine
تحسيب
Supertask
Zeno paradox

مراجع

^ Copeland and Proudfoot, Alan Turing's forgotten ideas in computer science. Scientific American, April 1999.

قراءة إضافية

Martin Davis, Why there is no such discipline as hypercomputation, Applied Mathematics and Computation, Volume 178, Issue 1, 1 July 2006, Pages 4-7, Special Issue on Hypercomputation
Mike Stannett, The case for hypercomputation, Applied Mathematics and Computation, Volume 178, Issue 1, 1 July 2006, Pages 8-24, Special Issue on Hypercomputation
Alan Turing, Systems of logic based on ordinals, Proc. London math. soc., 45, 1939
Hava Siegelmann. Neural Networks and Analog Computation: Beyond the Turing Limit Boston: Birkhäuser.
Hava Siegelmann. ; Theoretical Computer Science Volume 168, Issue 2, 20 November 1996, Pages 461-472.
Keith Douglas. Super-Turing Computation: a Case Study Analysis (PDF), M.S. Thesis, Carnegie Mellon University, 2003.
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.
On the computational power of neural nets
Toby Ord. : A survey article on various forms of hypercomputation.
Apostolos Syropoulos (2008), Hypercomputation: Computing Beyond the Church-Turing Barrier (preview), Springer. ISBN 9780387308869
Burgin, M. S. (1983) Inductive Turing Machines, Notices of the Academy of Sciences of the USSR, v. 270, No. 6, pp. 1289-1293
Mark Burgin (2005), Super-recursive algorithms, Monographs in computer science, Springer. ISBN 0387955690
Cockshott, P. and Michaelson, G. Are there new Models of Computation? Reply to Wegner and Eberbach, The computer Journal, 2007
Copeland, J. (2002) Hypercomputation, Minds and machines, v. 12, pp. 461-502
Martin Davis (2006), "The Church–Turing Thesis: Consensus and opposition". Proceedings, Computability in Europe 2006. Lecture notes in computer science, 3988 pp. 125–132
Hagar, A. and Korolev, A., Quantum Hypercomputation – Hype or Computation?, (2007)
Rogers, H. (1987) Theory of Recursive Functions and Effective Computability, MIT Press, Cambridge Massachusetts
Volkmar Putz and Karl Svozil, Can a computer be "pushed" to perform faster-than-light?, (2010)