Eleanor Audley and R (complexity): Difference between pages

(Difference between pages)
Content deleted Content added
m Popups-assisted redirection bypass from Movies to Film
 
mNo edit summary
 
Line 1:
The class of decision problems solvable by a Turing machine. Often identified with the class of 'effectively computable' functions (the Church-Turing thesis).
[[Image:Eleanor audley.png|thumb|right|120px|Eleanor Audley]]
 
Since we can decide any problem for which there exists a recogniser and also a co-recogniser, the class is equal to <math>RE \cap coRE</math>.
Born [[November 19]] [[1905]], in [[New York City]], [[New York]]. Died [[November 25]] [[1991]], of [[respiratory failure]], in [[North Hollywood]], [[California]].
 
==External links==
Actress and familiar voice, most notably as [[Maleficent]] in [[Sleeping Beauty]], Madame Leota in the [[Haunted Mansion]] ride at the American and Tokyo Disney parks, and the evil stepmother Lady Tremaine in [[Cinderella]]. Her many notable roles in [[Film|movies]] and numerous appearances on [[television]] in the [[1950s]] and [[60s]] made her a very recognizable person. One character she played was that of [[Oliver Wendell Douglas]]'s mother Eunice in the very popular "[[Green Acres]]" sitcom that aired on [[CBS]] from [[1965]]-[[1971]].
* [http://qwiki.caltech.edu/wiki/Complexity_Zoo#re Complexity Zoo]
 
[[Category:AmericanComplexity actorsclasses]]
 
[[Category:Disney]]
{{ComplexityClasses}}