Resource-Bounded Complexity

Author(s):  
Ming Li ◽  
Paul Vitányi
Keyword(s):  
1998 ◽  
Vol 08 (03) ◽  
pp. 271-282 ◽  
Author(s):  
Jerry L. Trahan ◽  
Anu G. Bourgeois ◽  
Ramachandran Vaidyanathan

A number of models allow processors to reconfigure their local connections to create and alter various bus configurations. This reconfiguration enables development of fast algorithms for fundamental problems, many in constant time. We investigate the ability of such models by relating time and processor bounded complexity classes defined for these models to each other and to those of more traditional models. In this work, (1) we tighten the relations for some of the models, placing them more precisely in relation to each other than was previously known (particularly, the Linear Reconfigurable Network and Directed Reconfigurable Network relative to circuit-defined classes), and (2) we include models (Fusing-Restricted Reconfigurable Mesh and Pipelined Reconfigurable Mesh) not previously considered.


2012 ◽  
Vol 18 (4) ◽  
pp. 505-553 ◽  
Author(s):  
Arnaud Durand ◽  
Neil D. Jones ◽  
Johann A. Makowsky ◽  
Malika More

AbstractIn 1952, Heinrich Scholz published a question in The Journal of Symbolic Logic asking for a characterization of spectra, i.e., sets of natural numbers that are the cardinalities of finite models of first order sentences. Günter Asser in turn asked whether the complement of a spectrum is always a spectrum. These innocent questions turned out to be seminal for the development of finite model theory and descriptive complexity. In this paper we survey developments over the last 50-odd years pertaining to the spectrum problem. Our presentation follows conceptual developments rather than the chronological order. Originally a number theoretic problem, it has been approached by means of recursion theory, resource bounded complexity theory, classification by complexity of the defining sentences, and finally by means of structural graph theory. Although Scholz' question was answered in various ways, Asser's question remains open.


2019 ◽  
Vol 41 (2) ◽  
pp. 494-533 ◽  
Author(s):  
WEN HUANG ◽  
JIAN LI ◽  
JEAN-PAUL THOUVENOT ◽  
LEIYE XU ◽  
XIANGDONG YE

We study dynamical systems that have bounded complexity with respect to three kinds metrics: the Bowen metric $d_{n}$, the max-mean metric $\hat{d}_{n}$ and the mean metric $\bar{d}_{n}$, both in topological dynamics and ergodic theory. It is shown that a topological dynamical system $(X,T)$ has bounded complexity with respect to $d_{n}$ (respectively $\hat{d}_{n}$) if and only if it is equicontinuous (respectively equicontinuous in the mean). However, we construct minimal systems that have bounded complexity with respect to $\bar{d}_{n}$ but that are not equicontinuous in the mean. It turns out that an invariant measure $\unicode[STIX]{x1D707}$ on $(X,T)$ has bounded complexity with respect to $d_{n}$ if and only if $(X,T)$ is $\unicode[STIX]{x1D707}$-equicontinuous. Meanwhile, it is shown that $\unicode[STIX]{x1D707}$ has bounded complexity with respect to $\hat{d}_{n}$ if and only if $\unicode[STIX]{x1D707}$ has bounded complexity with respect to $\bar{d}_{n}$, if and only if $(X,T)$ is $\unicode[STIX]{x1D707}$-mean equicontinuous and if and only if it has discrete spectrum.


Sign in / Sign up

Export Citation Format

Share Document