The concept of Turing machines can be used to represent complex problems and effective procedures or algorithms can be defined using the same. A problem is described as an infinite binary string using the language approach by Mike Sipser.