Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,300 papers from all fields of science
Search
Sign In
Create Free Account
Word problem (mathematics)
Known as:
Word problem
, Word problem (term rewriting)
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
Abstract rewriting system
Combinatory logic
Computer science
Confluence (abstract rewriting)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Investigating future primary teachers ' grasping of situations related to unequal partition word problems
L. Samková
2017
Corpus ID: 161053604
This contribution focuses on future primary teachers' grasping of situations related to unequal partition word problems. In the…
Expand
2015
2015
Word Problem Solver System Using Artificial Intelligence
Mitesh Miyani
,
Smit Doshi
,
Jayesh Jain
2015
Corpus ID: 60623155
2015
2015
Exploring Visualisation as a Strategy for Improving Year 4 & 5 Student Achievement on Mathematics Word Problems
Raymond John Teahen
2015
Corpus ID: 53908900
Solving mathematics word problems is more difficult for many students than solving comparable number only problems. Given the…
Expand
2010
2010
Exponentially generic subsets of groups
R. Gilman
,
A. Miasnikov
,
D. Osin
2010
Corpus ID: 50719577
In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the…
Expand
2010
2010
'I like it instead of maths': how pupils with moderate learning difficulties in Scottish primary special schools intuitively solved mathematical word problems
Lio Moscardini
2010
Corpus ID: 53486498
This study by Lio Moscardini of the University of Strathclyde shows how a group of 24 children in three Scottish primary schools…
Expand
2004
2004
Twisted conjugacy in free groups and Makanin's question
V. Bardakov
,
L. Bokut
,
A. Vesnin
2004
Corpus ID: 8252563
We discuss the following question of G. Makanin from ``Kourovka notebook'': does there exist an algorithm to determine is for an…
Expand
2004
2004
Improving School Children's Mathematical Word Problem Solving Skills through Computer-Based Multiple Representations
Tufan Adiguzel
,
Y. Akpinar
2004
Corpus ID: 18368492
Instructional resources that employ multiple representations have become commonplace in mathematics classrooms. This study will…
Expand
2001
2001
The Undecidability of λ-Definability
R. Loader
2001
Corpus ID: 27183899
In this article, we shall show that the Plotkin-Statman conjecture (Plotkin 1973, Statman 1982) is false. The conjecture was that…
Expand
2001
2001
TURING DEGREES AND THE WORD AND CONJUGACY PROBLEMS FOR FINITELY PRESENTED GROUPS
K. Kalorkoti
2001
Corpus ID: 12894281
The unsolvability of the conjugacy problem for finitely presented groups was first shown by Novikov [26]. Shortly thereafter the…
Expand
1998
1998
Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
J. Birget
International journal of algebra and computation
1998
Corpus ID: 22446273
The following algebraic characterization of the computational complexity of the word problem for finitely generated semigroups is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE