MST
2007
13 years 11 months ago
2007
We construct a finite language L such that the largest language commuting with L is not recursively enumerable. This gives a negative answer to the question raised by Conway in 1...