Limits of Algorithmic Computation

Nitin Garg, Nitigya Grover

Abstract


Form this follow a number of related problems for Turing machines and recursively enumerable languages. After this, we look at some questions relating to context-free languages. Here we find quite a few important problems for which, unfortunately, there are no algorithms.

Keywords


Algorithmic; Computation

Full Text:

PDF




Copyright (c) 2015 Nitin Garg, Nitigya Grover

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