Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.16607 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911930640236544 |
|---|---|
| author | Gonda, Tomáš Coves, Gemma De les |
| author_facet | Gonda, Tomáš Coves, Gemma De les |
| contents | A universal Turing machine is a powerful concept - a single device can compute any function that is computable. A universal spin model, similarly, is a class of physical systems whose low energy behavior simulates that of any spin system. Our categorical framework for universality (arXiv:2307.06851) captures these and other examples of universality as instances. In this article, we present an accessible account thereof with a focus on its basic ingredients and ways to use it. Specifically, we show how to identify necessary conditions for universality, compare types of universality within each instance, and establish that universality and negation give rise to unreachability (such as uncomputability). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_16607 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | An Invitation to Universality in Physics, Computer Science, and Beyond Gonda, Tomáš Coves, Gemma De les Computational Complexity Formal Languages and Automata Theory Mathematical Physics A universal Turing machine is a powerful concept - a single device can compute any function that is computable. A universal spin model, similarly, is a class of physical systems whose low energy behavior simulates that of any spin system. Our categorical framework for universality (arXiv:2307.06851) captures these and other examples of universality as instances. In this article, we present an accessible account thereof with a focus on its basic ingredients and ways to use it. Specifically, we show how to identify necessary conditions for universality, compare types of universality within each instance, and establish that universality and negation give rise to unreachability (such as uncomputability). |
| title | An Invitation to Universality in Physics, Computer Science, and Beyond |
| topic | Computational Complexity Formal Languages and Automata Theory Mathematical Physics |
| url | https://arxiv.org/abs/2406.16607 |