Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Word_problem_(mathematics)> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- Word_problem_(mathematics) abstract "In mathematics and computer science, a word problem for a set S with respect to a system of finite encodings of its elements is the algorithmic problem of deciding whether two given representatives represent the same element of the set. The problem is commonly encountered in abstract algebra, where given a presentation of an algebraic structure by generators and relators, the problem is to determine if two expressions represent the same element; a prototypical example is the word problem for groups. Less formally, the word problem in an algebra is: given a set of identities E, and two expressions x and y, is it possible to transform x into y using the identities in E as rewriting rules in both directions? While answering this question may not seem hard, the remarkable (and deep) result that emerges, in many important cases, is that the problem is undecidable.Many, if not most all, undecidable problems in mathematics can be posed as word problems; see the list of undecidable problems for many examples.".
- Word_problem_(mathematics) wikiPageID "3852079".
- Word_problem_(mathematics) wikiPageRevisionID "588937351".
- Word_problem_(mathematics) date "July 2013".
- Word_problem_(mathematics) date "June 2013".
- Word_problem_(mathematics) hasPhotoCollection Word_problem_(mathematics).
- Word_problem_(mathematics) reason "In which algebra? It is certainly decidable in ℤ".
- Word_problem_(mathematics) reason "In which lattice precisely? Unification maps two terms to a substitution, while term lattice meet maps two terms to a term, and substitution lattice meet maps two substitutions to a substitution.".
- Word_problem_(mathematics) reason "The solution of a word problem was explained above to be an algorithm, not a set.".
- Word_problem_(mathematics) subject Category:Abstract_algebra.
- Word_problem_(mathematics) subject Category:Combinatorics_on_words.
- Word_problem_(mathematics) subject Category:Computational_problems.
- Word_problem_(mathematics) subject Category:Rewriting_systems.
- Word_problem_(mathematics) type Artifact100021939.
- Word_problem_(mathematics) type Instrumentality103575240.
- Word_problem_(mathematics) type Object100002684.
- Word_problem_(mathematics) type PhysicalEntity100001930.
- Word_problem_(mathematics) type RewritingSystems.
- Word_problem_(mathematics) type System104377057.
- Word_problem_(mathematics) type Whole100003553.
- Word_problem_(mathematics) comment "In mathematics and computer science, a word problem for a set S with respect to a system of finite encodings of its elements is the algorithmic problem of deciding whether two given representatives represent the same element of the set.".
- Word_problem_(mathematics) label "Problème du mot".
- Word_problem_(mathematics) label "Word problem (mathematics)".
- Word_problem_(mathematics) sameAs Problème_du_mot.
- Word_problem_(mathematics) sameAs m.0b3b2f.
- Word_problem_(mathematics) sameAs Q3406273.
- Word_problem_(mathematics) sameAs Q3406273.
- Word_problem_(mathematics) sameAs Word_problem_(mathematics).
- Word_problem_(mathematics) wasDerivedFrom Word_problem_(mathematics)?oldid=588937351.
- Word_problem_(mathematics) isPrimaryTopicOf Word_problem_(mathematics).