Turing Machine for i-Head Hydra

Author

Kundra, Rohan ; Singhal, Harshul ; Nitin, Nitin

Author_Institution

Dept. of CSE & IT, Jaypee Univ. of Inf. Technol., Solan, India

fYear

2010

fDate

24-26 March 2010

Firstpage

11

Lastpage

15

Abstract

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.

Keywords

Turing machines; binary Turing machine; hacking sequence; i-head Hydra; Computational modeling; Computer crime; Computer hacking; Computer simulation; Information technology; Lakes; Magnetic heads; Microorganisms; Neck; Turing machines; Bacterial growth; Binary Turing Machine; Hacking Sequence; Hydra; Turing Machine; i-head Hydra;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Cambridge

Print_ISBN

978-1-4244-6614-6

Type

conf

DOI

10.1109/UKSIM.2010.11

Filename

5481025