On the complexity of Turing machine accepting fuzzy language

Author(s):  
Yingjun Pan ◽  
Tie Zou
Entropy ◽  
2020 ◽  
Vol 22 (1) ◽  
pp. 66
Author(s):  
Songsong Dai

In this paper, we give a definition for fuzzy Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a single finite string is the length of the shortest program that produces this string. We define the fuzzy Kolmogorov complexity as the minimum classical description length of a finite-valued fuzzy language through a universal finite-valued fuzzy Turing machine that produces the desired fuzzy language. The classical Kolmogorov complexity is extended to the fuzzy domain retaining classical descriptions. We show that our definition is robust, that is to say, the complexity of a finite-valued fuzzy language does not depend on the underlying finite-valued fuzzy Turing machine.


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

1989 ◽  
Author(s):  
Constantine Tsikos ◽  
Tom Chmielewski ◽  
Brian Frederick

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

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

Author(s):  
Jinjin Zhao ◽  
Shreyansh Bhatt ◽  
Candace Thille ◽  
Neelesh Gattani ◽  
Dawn Zimmaro

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Naoto Shiraishi ◽  
Keiji Matsumoto

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.


Sign in / Sign up

Export Citation Format

Share Document