Is everything computable?
By McDonald, T. | Last updated 30th of November Do you think your computer is amazing? It can do so much and reasonably quick most of the time, yes? Perhaps you are beginning to think it will not be long before a computer can accomplish any task especially with knowledge of Moore’s law whereby the number of transistors per square inch on an integrated circuit doubles every eighteen months. Nevertheless, some problems are not just difficult they are impossible to solve. For some problem to be computable, it would need to be possible to solve it in a finite number of steps for every instance of that problem; we call this effective procedure. Alan Turing came up with the idea of a machine that could solve a problem if given a set of precise instructions called a program, which he called a Turing machine. In addition, he theorised of a universal Turing machine that could take the state of any other Turing machine. It is important to remember that at the time, modern day co