Results 281 to 290 of about 2,583,141 (331)
Some of the next articles are maybe not open access.
The Word Problem Versus the Isomorphism Problem
Journal of the London Mathematical Society, 1984This clear paper contains the following (main) result: the isomorphism problem for the class of finitely presented lattice-ordered groups is insoluble. The authors show, using some ideas of \textit{K. A. Baker} [Can. J. Math. 20, 58-66 (1968; Zbl 0157.434)] and \textit{W. M. Beynon} [ibid.
Glass, A. M. W., Madden, James J.
openaire +2 more sources
The Mathematics Teacher, 1986
For several years now, I have been asked to share with junior and senior high school mathematics teachers in North Carolina ways to improve students' reading comprehension of word problems. My work with teachers and students has given me the opportunity to field-test several strategies for improving reading skills.
openaire +1 more source
For several years now, I have been asked to share with junior and senior high school mathematics teachers in North Carolina ways to improve students' reading comprehension of word problems. My work with teachers and students has given me the opportunity to field-test several strategies for improving reading skills.
openaire +1 more source
Word Problems on Compressed Words
2004We consider a compressed form of the word problem for finitely presented monoids, where the input consists of two compressed representations of words over the generators of a monoid \(\mathcal M\), and we ask whether these two words represent the same monoid element of \(\mathcal M\). For compression we use straight-line programs.
openaire +1 more source
Navigating financial toxicity in patients with cancer: A multidisciplinary management approach
Ca-A Cancer Journal for Clinicians, 2022Grace Li Smith +2 more
exaly
1995
Novikov, Boone, and Britton proved, independently, that there is a finitely presented group ℬ for which no computer can ever exist that can decide whether an arbitrary word on the generators of ℬ is 1. We shall prove this remarkable result in this chapter.
openaire +1 more source
Novikov, Boone, and Britton proved, independently, that there is a finitely presented group ℬ for which no computer can ever exist that can decide whether an arbitrary word on the generators of ℬ is 1. We shall prove this remarkable result in this chapter.
openaire +1 more source
2002
The word problem is a decision problem in group theory. It turns out to be a problem that is formally undecidable. We will explain here the necessary background in group theory and what the word problem is, and we will provide some discussion of the undecidability issue.
openaire +1 more source
The word problem is a decision problem in group theory. It turns out to be a problem that is formally undecidable. We will explain here the necessary background in group theory and what the word problem is, and we will provide some discussion of the undecidability issue.
openaire +1 more source
Tolerance and resistance of microbial biofilms
Nature Reviews Microbiology, 2022Oana Ciofu +2 more
exaly