Halting problem

Sunita Mandal, Neelima Saini

Abstract


In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running or continue to run forever

Keywords


Turing Machine; Decidablity



Bookmark and Share


Copyright (c) 2015 Sunita Mandal, Neelima Saini

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

 

All published Articles are Open Access at  https://journals.pen2print.org/index.php/ijr/ 


Paper submission: ijr@pen2print.org