The Word Problem in Combinatorial Calculus
The simplest example of an undecidable word problem occurs in combinatory logic: when are two strings of combinators equivalent? Because combinators encode all possible Turing machines, and the equivalence of two Turing machines is undecidable, it follows that the equivalence of two strings of combinators is undecidable.
Likewise, one has essentially the same problem in lambda calculus: given two distinct lambda expressions, there is no algorithm which can discern whether they are equivalent or not; equivalence is undecidable.
Read more about this topic: Word Problem (mathematics)
Famous quotes containing the words the word, word, problem and/or calculus:
“Please stop using the word Negro.... We are the only human beings in the world with fifty-seven variety of complexions who are classed together as a single racial unit. Therefore, we are really truly colored people, and that is the only name in the English language which accurately describes us.”
—Mary Church Terrell (18631954)
“Hardly had the glow been kindled by some good deed on your part or by some little triumph over your rivals or by a word of praise from your parents or mentors when it would begin to cool and fade leaving you in a very short time as chill and dim as before.”
—Samuel Beckett (19061989)
“But a problem occurs about nothing. For that from which something is made is a cause of the thing made from it; and, necessarily, every cause contributes some assistance to the effects existence.”
—Anselm of Canterbury (10331109)
“I try to make a rough music, a dance of the mind, a calculus of the emotions, a driving beat of praise out of the pain and mystery that surround me and become me. My poems are meant to make your mind get up and shout.”
—Judith Johnson Sherwin (b. 1936)