Fresnel diffraction: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
← Older edit
en>Chetvorno
Added mention of Fraunhofer diffraction to the introduction
en>Tom.Reding
m Gen fixes (page/s, endash, &nbsp, et al., unicodify, concising wikilinks, etc.), ref cleanup using AWB
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
{{lowercase|title=utm theorem}}
Nice to meet you, I am [http://Www.Nlm.Nih.gov/medlineplus/ency/article/000886.htm Marvella Shryock]. Puerto Rico is exactly where he's always  [http://chatmast.com/index.php?do=/BookerSipessk/info/ at home std testing] been residing but she requirements to move simply because of her family members. Body developing is one of the things I love most. For  over the counter std test years he's been operating as a meter reader  home std test kit and it's some thing he  std testing at home truly enjoy.<br><br>Take  [http://www.hamcass.org/index.php?document_srl=268708&mid=gido std testing at home] a look at my web page; [http://www.zavodpm.ru/blogs/ashelykeplerlkws/9653-valuable-guidance-successfully-treating-candida-albicans zavodpm.ru]
In [[computability theory]] the '''utm theorem''', or '''[[Universal Turing machine]] theorem''', is a basic result about [[Gödel numbering]]s of the set of [[computable function]]s. It affirms the existence of a computable '''universal function''' which is capable of calculating any other computable function. The universal function is an abstract version of the [[universal turing machine]], thus the name of the theorem.
 
[[Roger's equivalence theorem|Rogers equivalence theorem]] provides a characterization of the Gödel numbering of the computable functions in terms of the [[smn theorem]] and the utm theorem.
 
== utm theorem ==
 
Let <math>\varphi_1, \varphi_2, \varphi_3, ...</math> be an enumeration of Gödel numbers of computable functions. Then the partial function
:<math>u: \mathbb{N}^2 \to \mathbb{N}</math>
defined as
:<math>u(i,x) := \varphi_i(x) \qquad i,x \in \mathbb{N}</math>
is computable.
 
<math>u</math> is called the '''universal function'''.
 
== References ==
*{{cite book | author = Rogers, H. | title = The Theory of Recursive Functions and Effective Computability | publisher = First MIT press paperback edition | year = 1987 | origyear = 1967 | isbn = 0-262-68052-1 }}
*{{cite book | author = Soare, R.| title = Recursively enumerable sets and degrees | series = Perspectives in Mathematical Logic | publisher = Springer-Verlag | year = 1987 | isbn = 3-540-15299-7 }}
 
[[Category:Theory of computation]]
[[Category:Computability theory]]

Latest revision as of 03:21, 27 December 2014

Nice to meet you, I am Marvella Shryock. Puerto Rico is exactly where he's always at home std testing been residing but she requirements to move simply because of her family members. Body developing is one of the things I love most. For over the counter std test years he's been operating as a meter reader home std test kit and it's some thing he std testing at home truly enjoy.

Take std testing at home a look at my web page; zavodpm.ru

Retrieved from "https://en.formulasearchengine.com/index.php?title=Fresnel_diffraction&oldid=243008"