Is the Whitehead problem undecidable?

In 1936, Alan Turing proved that the halting problem —the question of whether or not a Turing machine halts on a given program—is undecidable, in the second sense of the term. This result was later generalized by Rice’s theorem . In 1973, Saharon Shelah showed the Whitehead problem in group theory is undecidable, in the first sense of the term, …
For More Information Please Refer:


You May Also Like to Read: