English
Related papers

Related papers: Efficient Squares and Turing Universality at Tempe…

200 papers

In geometrically frustrated assemblies, equilibrium self-limitation manifests in the form of a minimum in the free energy per subunit at a finite, multi-subunit size which results from the competition between the elastic costs of…

Soft Condensed Matter · Physics 2023-08-15 Michael Wang , Gregory Grason

Shape Memory Alloys (SMAs) are a unique class of intermetallic alloys that can cyclically sustain large deformations and recover a designed geometry through a solid-to-solid phase transformation. SMAs provide favorable actuation energy…

Applied Physics · Physics 2020-01-22 Daniel Martin , Lei Xu , Dimitris Lagoudas

Tur\'an problems in extremal combinatorics ask to find asymptotic bounds on the edge densities of graphs and hypergraphs that avoid specified subgraphs. The theory of flag algebras proposed by Razborov provides powerful methods based on…

Combinatorics · Mathematics 2017-08-30 Annie Raymond , Mohit Singh , Rekha R. Thomas

In existing general-purpose architectures for surface-code-based fault-tolerant quantum computers, the cost of a quantum computation is determined by the circuit volume, i.e., the number of qubits multiplied by the number of non-Clifford…

Quantum Physics · Physics 2022-11-29 Daniel Litinski , Naomi Nickerson

The energy efficiency and power of a three-terminal thermoelectric nanodevice are studied by considering elastic tunneling through a single quantum dot. Facilitated by the three-terminal geometry, the nanodevice is able to generate…

Mesoscale and Nanoscale Physics · Physics 2017-08-22 Jincheng Lu , Rongqian Wang , Yefeng Liu , Jian-Hua Jiang

Athermal (i.e. zero-temperature) under-constrained systems are typically floppy, but they can be rigidified by the application of external strain. Following our recently developed analytical theory for the athermal limit, here and in the…

Soft Condensed Matter · Physics 2024-12-31 Cheng-Tai Lee , Matthias Merkel

We prove that an effective temperature naturally emerges from the algorithmic structure of a regular universal Turing machine (UTM), without introducing any external physical parameter. In particular, the redundancy growth of the machine's…

Statistical Mechanics · Physics 2025-10-17 Kentaro Imafuku

We establish a structure theorem for the family of Ammann A2 tilings of the plane. Using that theorem we show that every Ammann A2 tiling is self-similar in the sense of [B. Solomyak, Nonperiodicity implies unique composition for…

Logic · Mathematics 2018-02-21 Bruno Durand , Alexander Shen , Nikolay Vereshchagin

A programmable linear resistor with a compact footprint would have profound implications for microelectronics, enabling efficient in-sensor analog signal processing and in-memory computing. Non-volatile memory offers a potential solution…

Clift and Murfet (2019) introduced a naive Bayesian smooth relaxation of Turing machines motivated by work in differential linear logic; this was subsequently used to endow spaces of program codes of bounded length with a smooth manifold…

Logic · Mathematics 2021-06-03 Adrian K. Xu

The emerging field of passive macro-scale tile-based self-assembly (TBSA) shows promise in enabling effective manufacturing processes by harnessing TBSA's intrinsic parallelism. However, current TBSA methodologies still do not fulfill their…

Robotics · Computer Science 2022-06-09 M. Jílek , K. Stránská , M. Somr , M. Kulich , J. Zeman , L. Přeučil

In this paper we introduce new classes of gluing of complex analytic spaces germs, called weakly large, large and strongly large. We give a description of their Poincar\'e series and, as applications, we give numerical criteria to determine…

Algebraic Geometry · Mathematics 2024-12-25 T. H. Freitas , J. A. Lima

Let $\mathcal{T}$ be a locally finite tree, $\Gamma$ be a discrete subgroup of $\textrm{Aut}(\mathcal{T})$ and $\widetilde{F}$ be a $\Gamma$-invariant potential. Suppose that the length spectrum of $\Gamma$ is not arithmetic. In this case,…

Dynamical Systems · Mathematics 2015-06-16 Sanghoon Kwon

The thermodynamic stability of germanium tin $\mathrm{Ge_{1-x}Sn_x}$ alloys is investigated across the composition range $0 \le x \le 1$ by applying density functional theory (DFT) together with the cluster expansion formalism (CE). It is…

Materials Science · Physics 2021-03-02 Alfonso Sanchez-Soares , Conor O'Donnell , James C. Greer

In this paper, we construct a large class of new simple modules over the twisted $N=2$ superconformal algebra. These new simple modules are restricted modules based on the simple modules over certain finite-dimensional solvable Lie…

Representation Theory · Mathematics 2025-06-05 Haibo Chen , Yucai Su , Yukun Xiao

Ab initio-calculated ideal strength and toughness describe the upper limits for mechanical properties attainable in real systems and can, therefore, be used in selection criteria for materials design. We employ density-functional ab initio…

Materials Science · Physics 2020-04-01 D. G. Sangiovanni , F. Tasnadi , L. J. S. Johnson , M. Oden , I. A. Abrikosov

A novel algorithm for producing smooth nonlinearities on digital hardware is presented. The non-linearities are inherently quadratic and have both symmetrical and asymmetrical variants. The integer (and fixed point) implementation is highly…

Machine Learning · Computer Science 2021-09-28 Adedamola Wuraola , Nitish Patel

It has been shown that four dimensional N=2 gauge theories, softly broken to N=1 by a superpotential term, can accommodate metastable non-supersymmetric vacua in their moduli space. We study the SU(2) theory at high temperatures in order to…

High Energy Physics - Theory · Physics 2015-05-13 Eleni Katifori , Georgios Pastras

We consider a new family $(\mathcal{T}_n)_{n\geq1}$ of aperiodic sets of Wang tiles and we describe the dynamical properties of the set $\Omega_n$ of valid configurations $\mathbb{Z}^2\to\mathcal{T}_n$. The tiles can be defined as the…

Dynamical Systems · Mathematics 2025-09-26 Sébastien Labbé

The Church-Turing thesis states that any sufficiently powerful computational model which captures the notion of algorithm is computationally equivalent to the Turing machine. This equivalence usually holds both at a computability level and…

Computational Complexity · Computer Science 2017-01-18 Amaury Pouly , Olivier Bournez , Daniel S. Graça