Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Richardson's_theorem> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items per page.
- Richardson's_theorem abstract "In mathematics, Richardson's theorem establishes a limit on the extent to which an algorithm can decide whether certain mathematical expressions are equal. It states that for a certain fairly natural class of expressions, it is undecidable whether a particular expression E satisfies the equation E = 0, and similarly undecidable whether the functions defined by expressions E and F are everywhere equal. It was proved in 1968 by computer scientist Daniel Richardson of the University of Bath.Specifically, the class of expressions for which the theorem holds is that generated by rational numbers, the number π, the number log 2, the variable x, the operations of addition, subtraction, multiplication, composition, and the sin, exp, and abs functions.For some classes of expressions (generated by other primitives than in Richardson's theorem) there exist algorithms that can determine whether expression is zero.".
- Richardson's_theorem wikiPageExternalLink AeqB.html.
- Richardson's_theorem wikiPageExternalLink 2271358.
- Richardson's_theorem wikiPageID "13463844".
- Richardson's_theorem wikiPageRevisionID "586910949".
- Richardson's_theorem hasPhotoCollection Richardson's_theorem.
- Richardson's_theorem title "Richardson's theorem".
- Richardson's_theorem urlname "RichardsonsTheorem".
- Richardson's_theorem subject Category:Computability_theory.
- Richardson's_theorem subject Category:Theorems_in_the_foundations_of_mathematics.
- Richardson's_theorem type Abstraction100002137.
- Richardson's_theorem type Communication100033020.
- Richardson's_theorem type Message106598915.
- Richardson's_theorem type Proposition106750804.
- Richardson's_theorem type Statement106722453.
- Richardson's_theorem type Theorem106752293.
- Richardson's_theorem type TheoremsInTheFoundationsOfMathematics.
- Richardson's_theorem comment "In mathematics, Richardson's theorem establishes a limit on the extent to which an algorithm can decide whether certain mathematical expressions are equal. It states that for a certain fairly natural class of expressions, it is undecidable whether a particular expression E satisfies the equation E = 0, and similarly undecidable whether the functions defined by expressions E and F are everywhere equal.".
- Richardson's_theorem label "Richardson's theorem".
- Richardson's_theorem label "Théorème de Richardson".
- Richardson's_theorem sameAs Théorème_de_Richardson.
- Richardson's_theorem sameAs m.03c64zk.
- Richardson's_theorem sameAs Q1249069.
- Richardson's_theorem sameAs Q1249069.
- Richardson's_theorem sameAs Richardson's_theorem.
- Richardson's_theorem wasDerivedFrom Richardson's_theorem?oldid=586910949.
- Richardson's_theorem isPrimaryTopicOf Richardson's_theorem.