By Topic

Turing Machine for i-Head Hydra

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kundra, R. ; Dept. of CSE & IT, Jaypee Univ. of Inf. Technol., Solan, India ; Singhal, H. ; Nitin, N.

The Hydra was a many-headed monster in Greek mythology which terrorized visitors near the marsh/lake of Lerna in Greece. Killing the Hydra proved to be quite a challenge, as two heads would grow back whenever one was cut off. In this paper, we considered i-head Hydra given by Kirby and Paris. We have implemented i-head Hydra using a combination of Turing and Binary Turing machine. The developed Turing machine defines the ith hack in the hacking sequence. By using this Turing machine recursively, it is shown that the i-head hydra (finite) is doomed. Further the Hydra is related to the exponential growth of bacteria, which has been shown to be doomed with the help of the defined Turing Machine.

Published in:

Computer Modelling and Simulation (UKSim), 2010 12th International Conference on

Date of Conference:

24-26 March 2010