Abstract
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 [5]. In our earlier schemes [5], 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
