Universality of Wolfram’s 2, 3 Turing Machine

2020 ◽  
Vol 29 (1) ◽  
pp. 1-44
Author(s):  
Alex Smith ◽  
Keyword(s):  
Turing Machine

SOFTWARE PROGRAMMABLE MODULE BASED ON TURING MACHINE

2016 ◽  
Vol 21 (97) ◽  
pp. 87-91
Author(s):  
Victor A. Krisilov ◽  
◽  
Gleb E. Romanov ◽  
Nikolaj I. Sinegub ◽  
◽  
...  
Keyword(s):  
Turing Machine

The Turing Machine Model of Sensing, Manipulation, and Control

1989 ◽  
Author(s):  
Constantine Tsikos ◽  
Tom Chmielewski ◽  
Brian Frederick
Keyword(s):  
Turing Machine ◽  
Machine Model ◽  
And Control ◽  
Manipulation And Control

Some Doubts about "Turing Machine Arguments"

1978 ◽  
Vol 45 (4) ◽  
pp. 638-647
Author(s):  
James D. Heffernan
Keyword(s):  
Turing Machine

Cold Start Knowledge Tracing with Attentive Neural Turing Machine

2020 ◽  
Author(s):  
Jinjin Zhao ◽  
Shreyansh Bhatt ◽  
Candace Thille ◽  
Neelesh Gattani ◽  
Dawn Zimmaro
Keyword(s):  
Turing Machine ◽  
Cold Start ◽  
Knowledge Tracing

scholarly journals Undecidability in quantum thermalization

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Naoto Shiraishi ◽  
Keiji Matsumoto
Keyword(s):  
Turing Machine ◽  
Thermal Equilibrium ◽  
General Theorem ◽  
Nearest Neighbour ◽  
Many Body ◽  
Initial State ◽  
One Dimensional ◽  
Universal Turing Machine ◽  
Many Body Systems ◽  
Neighbour Interaction

AbstractThe investigation of thermalization in isolated quantum many-body systems has a long history, dating back to the time of developing statistical mechanics. Most quantum many-body systems in nature are considered to thermalize, while some never achieve thermal equilibrium. The central problem is to clarify whether a given system thermalizes, which has been addressed previously, but not resolved. Here, we show that this problem is undecidable. The resulting undecidability even applies when the system is restricted to one-dimensional shift-invariant systems with nearest-neighbour interaction, and the initial state is a fixed product state. We construct a family of Hamiltonians encoding dynamics of a reversible universal Turing machine, where the fate of a relaxation process changes considerably depending on whether the Turing machine halts. Our result indicates that there is no general theorem, algorithm, or systematic procedure determining the presence or absence of thermalization in any given Hamiltonian.

Turing Machine Arguments

1980 ◽  
Vol 47 (4) ◽  
pp. 630-633
Author(s):  
R. J. Nelson
Keyword(s):  
Turing Machine
Sign in / Sign up

Export Citation Format

Share Document