翻訳と辞書 Words near each other ・ Hypericum asplundii ・ Hypercompe robusta ・ Hypercompe simplex ・ Hypercompe suffusa ・ Hypercompe tenebra ・ Hypercompe tessellata ・ Hypercompe testacea ・ Hypercompe theophila ・ Hypercompe trinitatis ・ Hypercompe turruptianoides ・ Hypercompetition ・ Hypercomplex analysis ・ Hypercomplex cell ・ Hypercomplex manifold ・ Hypercomplex number ・ Hypercomputation ・ Hyperconcentrated flow ・ Hypercone ・ Hypercone (spacecraft) ・ Hyperconjugation ・ Hyperconnected space ・ Hyperconnectivity ・ Hyperconsumerism ・ Hypercorrection ・ Hypercoryphodon ・ HyperCourseware ・ Hypercube ・ Hypercube graph ・ Hypercubic honeycomb ・ Hypercycle Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Hypercomputation ： ウィキペディア英語版 Hypercomputation Hypercomputation or super-Turing computation refers to models of computation that go beyond Turing computability. This includes various hypothetical methods for the computation of non-Turing-computable functions. The term "super-Turing computation" first appeared in talks, the PhD thesis,〔 〕 and even earlier technical reports of Hava Siegelmann since the early 1990s for a very particular theory (described below) and became a subfield of computation since her seminal 1995 ''Science'' paper.〔 (Work received wide media attention, and was mentioned as founding the field of HyperComputation.)〕 The term "hypercomputation" was introduced in 1999 by Jack Copeland and Diane Proudfoot.〔Copeland and Proudfoot, ''(Alan Turing's forgotten ideas in computer science )''. Scientific American, April 1999〕 The terms are not quite synonymous: "super-Turing computation" by Siegelmann usually implies that the proposed model is likely to exist in nature (via biology and/or physics) and may thus be physically realizable, while "hypercomputation" may be a general mathematical or philosophical idea. ==History== A computational model going beyond Turing machines was introduced by Alan Turing in his 1938 PhD dissertation ''Systems of Logic Based on Ordinals''.〔Alan Turing, 1939, ''Systems of Logic Based on Ordinals'' Proceedings London Mathematical Society Volumes 2–45, Issue 1, pp. 161–228.()〕 This paper investigated mathematical systems in which an oracle was available, which could compute a single arbitrary (non-recursive) function from naturals to naturals. He used this device to prove that even in those more powerful systems, undecidability is still present. Turing's oracle machines are mathematical abstractions, and are not physically realizable.〔"Let us suppose that we are supplied with some unspecified means of solving number-theoretic problems; a kind of oracle as it were. We shall not go any further into the nature of this oracle apart from saying that it cannot be a machine" (Undecidable p. 167, a reprint of Turing's paper ''Systems of Logic Based On Ordinals'')〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Hypercomputation」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.