Hard-limiter Neuron based Turing Machine Simulation with Constant Time Read/Write Operation

In Turing Machines, the input string can be of size n, where n is any natural number. The memory tape of the Turing Machine may store symbols which in general, may depend on this parameter n. Using hard-limiter neurons, earlier we introduced a framework for simulating a Turing machine, In our earlier schemes, for accessing one symbol on memory tape having m symbols, we needed the number of operations that depend (at least logarithmically) on m. In this paper, we introduce a framework for constant time access of any symbol on memory tape.