Mass problems

dc.contributor.author	Dahal, Sameep
dc.contributor.author	Basu, Sankha S. (Adviosr)
dc.date.accessioned	2022-04-01T05:31:20Z
dc.date.available	2022-04-01T05:31:20Z
dc.date.issued	2020-12
dc.identifier.uri	http://repository.iiitd.edu.in/xmlui/handle/123456789/999
dc.description.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].	en_US
dc.language.iso	en_US	en_US
dc.publisher	IIIT- Delhi	en_US
dc.subject	Mass Problems	en_US
dc.subject	Weak and Strong Degrees	en_US
dc.subject	Arithmetical Hierarchy	en_US
dc.title	Mass problems	en_US
dc.type	Other	en_US