Abstract:
There are several known problems that are algorithmically unsolvable such as the Halting problem, Hilbert’s 10th problem for Diophantine equations and so on. We are interested in the degree of insolvability of the problems that is to classify to the extent a problem is unsolvable. We discuss about the Mass Problems with respect to weak and strong reducibility as in [2] and explore the degree of insolvability of few mass problems. Furthermore, we discuss about randomness in the Cantor Space introduced in [1].