2020
DOI: 10.1088/1361-6544/ab9c71
|View full text |Cite
|
Sign up to set email alerts
|

Computability at zero temperature

Abstract: We investigate the computability of thermodynamic invariants at zero temperature for one-dimensional subshifts of finite type. In particular, we prove that the residual entropy (i.e., the joint ground state entropy) is an upper semi-computable function on the space of continuous potentials, but it is not computable. Next, we consider locally constant potentials for which the zerotemperature measure is known to exist. We characterize the computability of the zero-temperature measure and its entropy for potentia… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
3

Relationship

3
3

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 36 publications
0
5
0
Order By: Relevance
“…Additionally, computability at a point is a computable version of being continuous at a point. We refer the reader to section 3 and [15,27] for the precise definitions and details.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Additionally, computability at a point is a computable version of being continuous at a point. We refer the reader to section 3 and [15,27] for the precise definitions and details.…”
Section: Resultsmentioning
confidence: 99%
“…We prove that the space of potentials on a shift space X given by an oracle ψ with the finite alphabet A d is a computable metric space. For additional details, we refer the reader to [15]. We observe that the locally constant potentials with rational values (denoted by LC(X, Q)) are dense in C(X, R) with respect to the supremum norm.…”
Section: Computability Of Subshiftsmentioning
confidence: 99%
“…It should be noted however that it has been recently established that for a large class of continuous potentials the Evolutionary entropy is computable in the sense of computable analysis [7], i.e., it can be computed by a Turing machine (a computer program for our purposes) at any pre-described accuracy.…”
Section: Evolutionary Entropy and Cycle Timesmentioning
confidence: 99%
“…We prove that the space of potentials on a shift space X given by an oracle ψ with the finite alphabet A d is a computable metric space. For additional details, we refer the reader to [13]. We observe that the locally constant potentials with rational values (denoted by LC(X, Q)) are dense in C(X, R) with respect to the supremum norm.…”
Section: Computability Of Subshiftsmentioning
confidence: 99%
“…Additionally, computability at a point is a computable version of being continuous at a point. We refer the reader to Section 3 and [13,25] for the precise definitions and details.…”
mentioning
confidence: 99%