We investigate computability theoretic and topological properties of spaces of orders on computable orderable groups. A left order on a group G is a linear order of the domain of ...
Malgorzata A. Dabkowska, Mieczyslaw K. Dabkowski, ...
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
Complexity measures of non-linear dynamics are a useful tool for quantifying observed stretching, folding, scaling and mixing processes in the Takens-reconstructed state space of h...