Please use this identifier to cite or link to this item: http://repository.iiitd.edu.in/xmlui/handle/123456789/999
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDahal, Sameep-
dc.contributor.authorBasu, Sankha S. (Adviosr)-
dc.date.accessioned2022-04-01T05:31:20Z-
dc.date.available2022-04-01T05:31:20Z-
dc.date.issued2020-12-
dc.identifier.urihttp://repository.iiitd.edu.in/xmlui/handle/123456789/999-
dc.description.abstractThere 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.isoen_USen_US
dc.publisherIIIT- Delhien_US
dc.subjectMass Problemsen_US
dc.subjectWeak and Strong Degreesen_US
dc.subjectArithmetical Hierarchyen_US
dc.titleMass problemsen_US
dc.typeOtheren_US
Appears in Collections:Year-2020

Files in This Item:
File Description SizeFormat 
Sameep Dahal_2017264.pdf
  Restricted Access
300 kBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.