en>MFH: /* External links */ +Tomás Oliveira e Silva, [http://sweet.ua.pt/tos/primes.html Tables of prime-counting functions].

2014-12-31T18:13:11Z

External links: +Tomás Oliveira e Silva, [http://sweet.ua.pt/tos/primes.html Tables of prime-counting functions].

← Older revision		Revision as of 20:13, 31 December 2014
Line 1:		Line 1:
	In [[computability theory]], traditionally called recursion theory, a set ''S'' of [[natural numbers]] is called '''recursively enumerable''', '''computably enumerable''', '''semidecidable''', '''provable''' or '''Turing-recognizable''' if:		Hi! I am Dalton. Acting is a thing that Now i'm totally addicted to. Vermont is literally where my home could be described as. Managing men has been my 24-hour period job for a while but I plan using changing it. I've been training on my website just for some time now. Check it out here: http://Prometeu.net/<br><br>Feel free to surf to my web site ... [http://Prometeu.net/ hack clash of clans]

	*There is an [[algorithm]] such that the set of input numbers for which the algorithm halts is exactly ''S''.

	~~Or, equivalently,~~

	*There is an algorithm that [[enumeration\|enumerates]] the members of ''S''. ~~That means that its output~~ is ~~simply~~ a ~~list of the members of ''S'': ''s''<sub>1</sub>, ''s''<sub>2</sub>, ''s''<sub>3</sub>, ... . If necessary, this algorithm may run forever.~~

	The first condition suggests why the term ''semidecidable'' is sometimes used; the second suggests why ''computably enumerable'' is used. The abbreviations '''r.e.''' and '''c.e.''' are often used, even in print, instead of the full phrase.

	In [[computational complexity theory]], the [[complexity class]] containing all recursively enumerable sets is [[RE (complexity)\|RE]]. In [[recursion theory]], the [[Lattice (order)\|lattice]] of r.e. sets under inclusion is denoted <math>\mathcal{E}</math>.

	~~== Formal definition ==~~

	A set ''S'' of natural numbers is called '''recursively enumerable''' if there is a [[partial recursive function]] (synonymously, a partial computable function) whose [[domain (mathematics)\|domain]] is exactly ''S'', meaning that ~~the function is defined if and only if its input is a member of~~ '~~'S''.~~

	~~==Equivalent formulations==~~
	~~The following are all equivalent properties of a set ''S'' of natural numbers:~~

	~~:Semidecidability:~~
	~~:*The set ''S'' is recursively enumerable. That is, ''S'' is the domain (co-range) of a partial recursive function.~~
	~~:*There is a partial recursive function ''f'' such that:~~
	~~::<math>f(x) =~~
	~~\left\{\begin{matrix}~~
	~~0 &\mbox{if}\ x \in S \\~~
	~~\mbox{undefined/does not halt}\ &\mbox{if}\ x \notin S~~
	~~\end{matrix}\right.~~
	~~</math>~~
	~~:Enumerability:~~
	~~:*The set ''S'' is the range of a partial recursive function.~~
	~~:*The set ''S'' is the range of a total recursive function or empty. If ''S'' is infinite, the function can be chosen~~ to ~~be [[injective]]~~.
	~~:*The set ''S''~~ is ~~the range of a [[primitive recursive function]] or empty. Even if ''S'' is infinite, repetition of values may~~ be ~~necessary in this case~~.
	~~:Diophantine:~~
	~~:*There is a polynomial ''p'' with integer coefficients and variables ''x'', ''a'', ''b'', ''c'', ''d'', ''e'', ''f'', ''g'', ''h'', ''i'' ranging over the natural numbers such that~~
	~~::<math>x \in S \Leftrightarrow \exists a,b,c,d,e,f,g,h,i \ ( p(x,a,b,c,d,e,f,g,h,i) = 0).</math>~~
	~~:*There is a polynomial from the integers to the integers such that the set ''S'' contains exactly the non~~-~~negative numbers in its range.~~

	~~The equivalence of semidecidability and enumerability can be obtained by the technique of [[Dovetailing_(computer_science)\|dovetailing]].~~

	~~The Diophantine characterizations of~~ a ~~recursively enumerable set,~~ while not as straightforward or intuitive as the first definitions, were found by [[Yuri Matiyasevich]] as part of the negative solution to [[Hilbert's tenth problem\|Hilbert's Tenth Problem]]. Diophantine sets predate recursion theory and are therefore historically the first way to describe these sets (although this equivalence was only remarked more than three decades after the introduction of recursively enumerable sets).
	~~The number of bound variables in the above definition of the [[Diophantine set]] is the best known so far; it might be that a lower number can be used to define all diophantine sets.~~

	~~{\| style="float:right"~~
	\| [[File:Recursive enumeration of all halting Turing machines.gif\|thumb\|450px\|Recursive enumeration of the set of all Turing machines halting on a fixed input: Simulate all Turing machines (enumerated on vertical axis) step by step (horizontal axis), using the shown diagonalization scheduling. If a machine terminates, print its number. This way, the number of each terminating machine is eventually printed. In the example, the algorithm prints "9, 13, 4, 15, 12, 18, 6, 2, 8, 0, ..."]]
	\|}
	~~==Examples==~~
	* Every [[recursive set]] is recursively enumerable, but it ~~is not true that every recursively enumerable set is recursive~~. ~~For recursive sets, the algorithm must also say if an input is~~ '~~'not'' in the set – this is not required of recursively enumerable sets.~~
	* A [[recursively enumerable language]] is a recursively enumerable subset of a [[formal language]].
	* The set of all provable sentences in an effectively presented axiomatic system is a recursively enumerable set.
	* [[Matiyasevich's theorem]] states that every recursively enumerable set is a [[Diophantine set]] (the converse is trivially true).
	* The [[simple set]]s are recursively enumerable but not recursive.
	* The [[creative set]]s are recursively enumerable but not recursive.
	* Any [[productive set]] is '''not''' recursively enumerable.
	* Given a [[Gödel numbering]] <math>\phi</math> of the computable functions, the set <math>\{\langle i,x \rangle \mid \phi_i(x) \downarrow \}</math> (where <math>\langle i,x \rangle</math> is the [[Cantor pairing function]] and <math>\phi_i(x)\downarrow</math> indicates <math>\phi_i(x)</math> is defined) is recursively enumerable (cf. picture for ~~a fixed ''x'')~~. ~~This set encodes the [[halting problem]] as~~ it ~~describes the input parameters for which each [[Turing machine]] halts.~~
	* Given a Gödel numbering <math>\phi</~~math> of the computable functions, the set <math>\lbrace \left \langle x, y, z \right \rangle \mid \phi_x(y)=z \rbrace<~~/~~math> is recursively enumerable~~. ~~This set encodes the problem of deciding a function value.~~
	* Given a partial function ''f'' from the natural numbers into the natural numbers, ''f'' is a partial recursive function if and only if the graph of ''f'', that is, the set of all pairs <~~math~~>~~\langle x,f(x)\rangle~~<~~/math~~> ~~such that ''f(x)'' is defined, is recursively enumerable~~.

	~~==Properties==~~

	If ''A'' and ''B'' are recursively enumerable sets then ''A'' ∩ ''B'', ''A'' ∪ ''B'' and ''A'' × ''B'' (with the ordered pair of natural numbers mapped to a single natural number with the [[Cantor pairing function]]) are recursively enumerable sets. ~~The [[preimage]] of a recursively enumerable set under a partial recursive function is a recursively enumerable set~~.

	~~A set is recursively enumerable if and only if it is at level <math>\Sigma^0_1</math> of the~~ [~~[arithmetical hierarchy]].~~

	~~A set <math>T<~~/~~math> is called '''co-recursively enumerable''' or '''co-r.e.''' if its [[complement (set theory)\|complement]] <math>\mathbb{N} \setminus T<~~/~~math> is recursively enumerable. Equivalently, a set is co-r~~.~~e. if and only if it is at level <math>\Pi^0_1<~~/~~math> of the arithmetical hierarchy.~~

	A set ''A'' is [[recursive set\|recursive]] (synonym: computable) if and only if both ''A'' and the complement of ''A'' are recursively enumerable. A set is recursive if and only if it is either the range of an increasing total recursive function or finite.

	~~Some pairs of recursively enumerable sets are [[effectively separable]] and some are not.~~

	~~== Remarks ==~~
	According to the [[Church-Turing thesis]], any effectively calculable function is calculable by a [[Turing machine]], and thus a set ''S'' is recursively enumerable if and only if there is some [[algorithm]] which yields an enumeration of ''S''. This cannot be taken as a formal definition, however, because the Church-Turing thesis is an informal conjecture rather than a formal axiom.

	The definition of a recursively enumerable set as the ''domain'' of a partial function, rather than the ''range'' of a total recursive function, is common in contemporary texts. This choice is motivated by the fact that in generalized recursion theories, such as [[Alpha recursion theory\|α-recursion theory]], the definition corresponding to domains has been found to be more natural. Other texts use the definition in terms of enumerations, which is equivalent for recursively enumerable sets.

	~~== References ==~~
	* Rogers, H. ''The Theory of Recursive Functions and Effective Computability'', [[MIT Press]]. ISBN 0-262-68052-1; ISBN 0-07-053522-1.
	* Soare, R. Recursively enumerable sets and degrees. ''Perspectives in Mathematical Logic.'' [[Springer-Verlag]], Berlin, 1987. ISBN 3-540-15299-7.
	* Soare, Robert I. Recursively enumerable sets and degrees. ''Bull. Amer. Math. Soc.'' 84 (1978), no. 6, 1149–1181.

	~~{{logic}}~~

	~~[[Category:Computability theory]]~~
	~~[[Category:Theory~~ of ~~computation]~~]

en>Psychonaut: Reverted 5 edits by Konstantinos Gaitanas: Rv; please cite a reliable source such as a peer-reviewed journal article. Don't post your original research here. (TW)

2014-01-30T11:29:36Z

Reverted 5 edits by Konstantinos Gaitanas: Rv; please cite a reliable source such as a peer-reviewed journal article. Don't post your original research here. (TW)

Show changes

en>D. B. Staple: /* Added reference to unconditional computation of pi(10^24) by D. J. Platt */

2012-07-25T13:20:35Z

Added reference to unconditional computation of pi(10^24) by D. J. Platt

New page

This particular next step to such game''s success is that may it produces the illusion that it''s a multi player game. I come to feel it''s a [http://www.Adobe.com/cfusion/search/index.cfm?term=&fantasy&loc=en_us&siteSection=home fantasy] considering you don''t do what has necessary directly with another player. You don''t fight and explore while doing so like you would found in Wow, of play within another player even as a result of with a turn-by-turn justification comparable to Chess. Any time you raid another player''s village, that do player is [http://Search.Un.org/search?ie=utf8&site=un_org&output=xml_no_dtd&client=UN_Website_en&num=10&lr=lang_en&proxystylesheet=UN_Website_en&oe=utf8&q=offline&Submit=Go offline] and you could at this particular same time just develop into raiding a random computer-generated village. amend delivers a large amount of notable enhancements, the alignment of which could turn out to be the new Dynasty Struggle Manner. In the idea mode, you can making claims combating dynasties and alleviate utter rewards aloft personal beat. In clash of clans Cheats (a mysterious popular social architecture otherwise arresting bold by Supercell) participants can acceleration mass popularity accomplishments for example building, advance or training militia with gems that are being sold for absolute cash. They're basically monetizing this player's eagerness. Every amusing architecture vibrant I apperceive of manages to do it. If you have any kind of questions pertaining to where and the best ways to use hack clash of clans; [http://prometeu.net stay with me],, you could contact us at our internet site. Should you feel like users targeted your enemy site on in a shooter and still missed, inspection what weapon you include using. Just resembling in real life, different weapons have different plus points and weaknesses. A person's weapon you are using may not have your current short distance required aka the weapon recoil is ordinarily actually putting you bit off target. Rugby season is here as well as , going strong, and including many fans we far for Sunday afternoon when the games begin. If you have tried and liked Soul Caliber, you will love this particular game. The succeeding best is the Chip Cell which will randomly fill in some squares. Defeating players like for example that by any involves necessary can be some reason that pushes all of them with to use Words with Friends Cheat. Each app requires you to be answer 40 questions by having varying degrees of difficulties. To allow them to defeat higher-level villages, job aids you to use a mixture of troops reminiscent of Barbarians plus Archers nicely those suicide wall bombers to bust down wall spaces. Goblins can also be a useful inflexion the combo simply because they attack different buildings. You should understand really want to begin worrying concerning higher troops when your family can''t win battles offering Barbarians. As well as our options are considered and approved from the most effective virus recognition software yet anti-virus in the target ensure a security-level as huge as you can, in event you fear for the security of your computer maybe cellular device, no concerns. In case you nevertheless have any sort of doubts, take a brows through the movie and you'll focus on it operates and it's very 100% secure! It takes merely a few moments of your respective!

Prime-counting function - Revision history

en>MFH: /* External links */ +Tomás Oliveira e Silva, [http://sweet.ua.pt/tos/primes.html Tables of prime-counting functions].

en>Psychonaut: Reverted 5 edits by Konstantinos Gaitanas: Rv; please cite a reliable source such as a peer-reviewed journal article. Don't post your original research here. (TW)

en>D. B. Staple: /* Added reference to unconditional computation of pi(10^24) by D. J. Platt */