Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.14670 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929475518726144 |
|---|---|
| author | Gupta, Chetan Jain, Rahul Sharma, Vimal Raj Tewari, Raghunath |
| author_facet | Gupta, Chetan Jain, Rahul Sharma, Vimal Raj Tewari, Raghunath |
| contents | A catalytic Turing machine is a variant of a Turing machine in which there exists an auxiliary tape in addition to the input tape and the work tape. This auxiliary tape is initially filled with arbitrary content. The machine can read and write on the auxiliary tape, but it is constrained to restore its initial content when it halts. Studying such a model and finding its powers and limitations has practical applications.
In this paper, we study catalytic Turing machines with O(log n)-sized work tape and polynomial-sized auxiliary tape that are allowed to lose at most constant many bits of the auxiliary tape when they halt. We show that such catalytic Turing machines can only decide the same set of languages as standard catalytic Turing machines with the same size work and auxiliary tape. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_14670 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Lossy Catalytic Computation Gupta, Chetan Jain, Rahul Sharma, Vimal Raj Tewari, Raghunath Computational Complexity A catalytic Turing machine is a variant of a Turing machine in which there exists an auxiliary tape in addition to the input tape and the work tape. This auxiliary tape is initially filled with arbitrary content. The machine can read and write on the auxiliary tape, but it is constrained to restore its initial content when it halts. Studying such a model and finding its powers and limitations has practical applications. In this paper, we study catalytic Turing machines with O(log n)-sized work tape and polynomial-sized auxiliary tape that are allowed to lose at most constant many bits of the auxiliary tape when they halt. We show that such catalytic Turing machines can only decide the same set of languages as standard catalytic Turing machines with the same size work and auxiliary tape. |
| title | Lossy Catalytic Computation |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2408.14670 |