%0 Journal Article %1 P__2015 %A Tanana, Boris P. %A Cassy, Bhangy %D 2015 %I Auricle Technologies, Pvt., Ltd. %J International Journal on Recent and Innovation Trends in Computing and Communication %K Machine Turing accepted diagonalization enumerable language recursive recursively universal %N 2 %P 613--615 %R 10.17762/ijritcc2321-8169.150239 %T On the Coding of a Turing Machines and Non- Recursive Languages %U http://dx.doi.org/10.17762/ijritcc2321-8169.150239 %V 3 %X In this paper we present one type of problems not previously encountered in the academic literature to validate the actual students' understanding, not memorization formal, definitions of certain non-recursive languages

@article{P__2015, abstract = {In this paper we present one type of problems not previously encountered in the academic literature to validate the actual students' understanding, not memorization formal, definitions of certain non-recursive languages}, added-at = {2015-08-04T07:38:00.000+0200}, author = {Tanana, Boris P. and Cassy, Bhangy}, biburl = {https://www.bibsonomy.org/bibtex/2b1f0d31d94b7fb5bb7d4de991d15aeb7/ijritcc}, doi = {10.17762/ijritcc2321-8169.150239}, interhash = {163e03ca50dfd69077f853f3ef723191}, intrahash = {b1f0d31d94b7fb5bb7d4de991d15aeb7}, journal = {International Journal on Recent and Innovation Trends in Computing and Communication}, keywords = {Machine Turing accepted diagonalization enumerable language recursive recursively universal}, month = {february}, number = 2, pages = {613--615}, publisher = {Auricle Technologies, Pvt., Ltd.}, timestamp = {2015-08-04T07:38:00.000+0200}, title = {On the Coding of a Turing Machines and Non- Recursive Languages}, url = {http://dx.doi.org/10.17762/ijritcc2321-8169.150239}, volume = 3, year = 2015 }