Zobrazeno 1 - 10
of 32 282
pro vyhledávání: '"Turing machines"'
Autor:
Wolpert, David, Scharnhorst, Jordan
Computer science theory provides many different measures of complexity of a system including Kolmogorov complexity, logical depth, computational depth, and Levin complexity. However, these measures are all defined only for deterministic Turing machin
Externí odkaz:
http://arxiv.org/abs/2410.07131
Autor:
Jajal, Purvish, Eliopoulos, Nick John, Chou, Benjamin Shiue-Hal, Thiravathukal, George K., Davis, James C., Lu, Yung-Hsiang
We propose Vision Token Turing Machines (ViTTM), an efficient, low-latency, memory-augmented Vision Transformer (ViT). Our approach builds on Neural Turing Machines and Token Turing Machines, which were applied to NLP and sequential visual understand
Externí odkaz:
http://arxiv.org/abs/2409.07613
Large Language Models (LLMs) have demonstrated remarkable capabilities across a wide range of natural language processing and reasoning tasks. However, their performance in the foundational domain of arithmetic remains unsatisfactory. When dealing wi
Externí odkaz:
http://arxiv.org/abs/2410.07896
Autor:
Graça, Daniel1,2 (AUTHOR) dgraca@ualg.pt, Zhong, Ning3 (AUTHOR) ning.zhong@uc.edu
Publikováno v:
Computability. 2023, Vol. 12 Issue 2, p117-144. 28p.
Autor:
Carmody, Erin
This paper analyzes infinitary nondeterministic computability theory. The main result is D $\ne$ ND $\cap$ coND where D is the class of sets decidable by infinite time Turing machines and ND is the class of sets recognizable by a nondeterministic inf
Externí odkaz:
http://arxiv.org/abs/2312.15748
Autor:
Cheraghchi, Mahdi1 (AUTHOR), Hirahara, Shuichi2 (AUTHOR), Myrisiotis, Dimitrios3 (AUTHOR) dimitris@nus.edu.sg, Yoshida, Yuichi2 (AUTHOR)
Publikováno v:
Theory of Computing Systems. Aug2024, Vol. 68 Issue 4, p868-899. 32p.
Autor:
Freund, Rudolf
Publikováno v:
Computer Science Journal of Moldova. 2024, Vol. 32 Issue 3, p310-314. 5p.
Autor:
Blanc, Manon, Bournez, Olivier
We prove that functions over the reals computable in polynomial time can be characterised using discrete ordinary differential equations (ODE), also known as finite differences. We also provide a characterisation of functions computable in polynomial
Externí odkaz:
http://arxiv.org/abs/2307.11747
Publikováno v:
Quantum 8, 1230 (2024)
This work presents a study of Kolmogorov complexity for general quantum states from the perspective of deterministic-control quantum Turing Machines (dcq-TM). We extend the dcq-TM model to incorporate mixed state inputs and outputs, and define dcq-co
Externí odkaz:
http://arxiv.org/abs/2305.14252
Autor:
Daylight, Edgar Graham1 (AUTHOR) egdaylight@dijkstrascry.com
Publikováno v:
Philosophies. Aug2024, Vol. 9 Issue 4, p122. 18p.