Image de couverture de livre

An origami Universal Turing Machine design

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Assis, Michael
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Flat origami is Turing Complete
par: Hull, Thomas C., et autres
Publié: (2023)

Metastability-Containing Turing Machines
par: Bund, Johannes, et autres
Publié: (2026)

How Pinball Wizards Simulate a Turing Machine
par: Adejoh, Rosemary, et autres
Publié: (2025)

Fagin's Theorem for Semiring Turing Machines
par: Badia, Guillermo, et autres
Publié: (2025)

Complex Boolean Turing Machines: An Algebraic Semantic Framework for Computational Complexity
par: Zheng, Bojin, et autres
Publié: (2026)

Dual-Tape Perspective and Generator Independence: The Algebraic Foundation of Real Boolean Turing Machines
par: Zheng, Jingwen, et autres
Publié: (2026)

Simulating Polynomial-Time Nondeterministic Turing Machines via Nondeterministic Turing Machines
par: Lin, Tianrong
Publié: (2024)

Stochastic Process Turing Machines
par: Wolpert, David, et autres
Publié: (2024)

Black-Box PWPP Is Not Turing-Closed
par: Hubáček, Pavel
Publié: (2026)

Iterative Optimization of Multidimensional Functions on Turing Machines under Performance Guarantees
par: Boche, Holger, et autres
Publié: (2025)

Efficient Turing Machine Simulation with Transformers
par: Li, Qian, et autres
Publié: (2025)

Prime Successor Irreducibility: Turing Machine Complexity, Kolmogorov Complexity, and Weakness-Based Formulations
par: Goertzel, Ben, et autres
Publié: (2026)

Topological entropy of Turing complete dynamics
par: Bruera, Renzo, et autres
Publié: (2024)

Turing Completeness and Sid Meier's Civilization
par: de Wynter, Adrian
Publié: (2021)

Diagonalization of Polynomial-Time Deterministic Turing Machines via Nondeterministic Turing Machines
par: Lin, Tianrong
Publié: (2021)

Ask, and it shall be given: On the Turing completeness of prompting
par: Qiu, Ruizhong, et autres
Publié: (2024)

Constant Bit-size Transformers Are Turing Complete
par: Li, Qian, et autres
Publié: (2025)

Infinite Time Turing Machines and their Applications
par: Weerawarana, Rukmal, et autres
Publié: (2025)

The Computational Boundary of Inference: Capability Internalization, Training, and the Turing Jump
par: Lu, Chien-Ping
Publié: (2026)

A conservative Turing complete $S^4$ flow
par: Suárez-Serrato, Pablo
Publié: (2023)

Perfect diffusion is $\mathsf{TC}^0$ -- Bad diffusion is Turing-complete
par: Liu, Yuxi
Publié: (2025)

Rethinking the Role of Positional Encoding: Sliding-Window Transformers without PE Remain Turing Complete
par: Li, Qian, et autres
Publié: (2026)

Cypher is Turing-Complete: A Formal Proof via 2-Counter Machine Simulation
par: Halftermeyer, Pierre
Publié: (2026)

A note reviewing Turing's 1936
par: Cattabriga, Paola
Publié: (2013)

Quantum Kolmogorov complexity and quantum correlations in deterministic-control quantum Turing machines
par: Lemus, Mariano, et autres
Publié: (2023)

What If Turing Had Preceded Gödel?
par: Oberhoff, Sebastian
Publié: (2024)

Multiplicative Turing Ensembles, Pareto's Law, and Creativity
par: Kolpakov, Alexander, et autres
Publié: (2025)

Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs
par: Nederlof, Jesper, et autres
Publié: (2023)

Turing in the shadows of Nobel and Abel: an algorithmic story behind two recent prizes
par: Gamarnik, David
Publié: (2025)

Barriers to Complexity-Theoretic Proofs that "AGI" Using Machine Learning is Impossible
par: Guerzhoy, Michael
Publié: (2024)

Breaking the Temporal Complexity Barrier: Bucket Calculus for Parallel Machine Scheduling
par: Mohammad, Noor Islam S.
Publié: (2026)

Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations
par: Blanc, Manon, et autres
Publié: (2023)

Efficient approximate unitary designs from random Pauli rotations
par: Haah, Jeongwan, et autres
Publié: (2024)

Benford's Law from Turing Ensembles and Integer Partitions
par: Kolpakov, Alexander, et autres
Publié: (2025)

Circuits and Backdoors: Five Shades of the SETH
par: Lampis, Michael
Publié: (2024)

Turing complete Navier-Stokes steady states via cosymplectic geometry
par: Dyhr, Søren, et autres
Publié: (2025)

A Brief Note on a Recent Claim About NP-Hard Problems and BQP
par: Chavrimootoo, Michael C.
Publié: (2024)

Multiparty Communication Complexity of Collision Finding
par: Beame, Paul, et autres
Publié: (2024)

d-QBF with Few Existential Variables Revisited
par: Grigorjew, Andreas, et autres
Publié: (2026)

Plagiarism Detection Using Machine Learning
par: Kamat, Omraj, et autres
Publié: (2024)