Complexity of some natural problems on the class of computable I-algebras

We study computable Boolean algebras with distinguished ideals (I-algebras for short). We prove that the isomorphism problem for computable I-algebras is Σ ₁ ¹ -complete and show that the computable isomorphism problem and the computable categoricity problem for computable I-algebras are Σ ₃ ⁰ -complete.     

Complexity of Categorical Theories with Computable Models

M. Lerman and J. Scmerl specified some sufficient conditions for computable models of countably categorical arithmetical theories to exist. More precisely, it was shown that if T is a countably categorical arithmetical theory, and the set of its sentences beginning with an existential quantifier and having at most n+1 alternations of quantifiers is _n+1 ⁰ for any n, then T has a computable model. J. Night improved this result by allowing certain uniformity and omitting the requirement that T is arithmetical. However, all of the known examples of theories of₀-categorical computable models had low level of algorithmic complexity, and whether there are theories that would satisfy the above conditions for sufficiently large n was unknown. This paper will include such examples.     

Monotonically Computable Real Numbers

Area number x is called k‐monotonically computable (k‐mc), for constant k > 0, if there is a computable sequence (x_n)_{n ∈ ℕ} of rational numbers which converges to x such that the convergence is k‐monotonic in the sense that k · |x — x_n| ≥ |x — x_m| for any m > n and x is monotonically computable (mc) if it is k‐mc for some k > 0. x is weakly computable if there is a computable sequence (x_s)_{s ∈ ℕ} of rational numbers converging to x such that the sum $\sum _{s \in \mathbb{N}}$|x_s — x_{s + 1}| is finite. In this paper we show that a mc real numbers are weakly computable but the converse fails. Furthermore, we show also an infinite hierarchy of mc real numbers.     

h‐monotonically computable real numbers

Let h : ? → ? be a computable function. A real number x is called h‐monotonically computable (h‐mc, for short) if there is a computable sequence (x_s) of rational numbers which converges to x h‐monotonically in the sense that h(n)|x – x_n| ≥ |x – x_m| for all n andm > n. In this paper we investigate classes h‐ MC of h‐mc real numbers for different computable functions h. Especially, for computable functions h : ? → (0, 1)_?, we show that the class h‐ MC coincides with the classes of computable and semi‐computable real numbers if and only if Σ_i∈?(1 – h(i)) = ∞and the sum Σ_i∈?(1 – h(i)) is a computable real number, respectively. On the other hand, if h(n) ≥ 1 and h converges to 1, then h‐ MC = SC (the class of semi‐computable reals) no matter how fast h converges to 1. Furthermore, for any constant c > 1, if h is increasing and converges to c, then h‐ MC = c‐ MC . Finally, if h is monotone and unbounded, then h‐ MC contains all ω‐mc real numbers which are g‐mc for some computable function g. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Degree Spectra of Relations on Boolean Algebras

We show that every computable relation on a computable Boolean algebra is either definable by a quantifier-free formula with constants from (in which case it is obviously intrinsically computable) or has infinite degree spectrum.     

When series of computable functions with varying domains are computable

In this paper we study the behavior of computable series of computable partial functions with varying domains (but each domain containing all computable points), and prove that the sum of the series exists and is computable exactly on the intersection of the domains when a certain computable Cauchyness criterion is met. In our point‐free approach, we name points via nested sequences of basic open sets, and thus our functions from a topological space into the reals are generated by functions from basic open sets to basic open sets. The construction of a function that produces the sum of a series requires working with an infinite array of pairs of basic open sets, and reconciling the varying domains. We introduce a general technique for using such an array to produce a set function that generates a well‐defined point function and apply the technique to a series to establish our main result. Finally, we use the main finding to construct a computable, and thus continuous, function whose domain is of Lebesgue measure zero and which is nonextendible to a continuous function whose domain properly includes the original domain. (We had established existence of such functions with domains of measure less than ε for any , in an earlier paper.)     

Universal Numbering for Constructive I-Algebras

Constructive Boolean algebras with distinguished ideals (we call them I-algebras in what follows) are studied. It is proved that a class of all constructive I-algebras is strongly computable, that is, the class of constructive I-algebras contains a principal computable numbering.     

A hierarchy of Turing degrees of divergence bounded computable real numbers

A real number x is f-bounded computable (f-bc, for short) for a function f if there is a computable sequence (x_s) of rational numbers which converges to x f-bounded effectively in the sense that, for any natural number n, the sequence (x_s) has at most f(n) non-overlapping jumps of size larger than 2^-n. f-bc reals are called divergence bounded computable if f is computable. In this paper we give a hierarchy theorem for Turing degrees of different classes of f-bc reals. More precisely, we will show that, for any computable functions f and g, if there exists a constant γ>1 such that, for any constant c, f(nγ)+n+cg(n) holds for almost all n, then the classes of Turing degrees given by f-bc and g-bc reals are different. As a corollary this implies immediately the result of [R. Rettinger, X. Zheng, On the Turing degrees of the divergence bounded computable reals, in: CiE 2005, June 8–15, Amsterdam, The Netherlands, Lecture Notes in Computer Science, vol. 3526, 2005, Springer, Berlin, pp. 418–428.] that the classes of Turing degrees of d-c.e. reals and divergence bounded computable reals are different.     

On computable formal concepts in computable formal contexts

We introduce and study the notions of computable formal context and computable formal concept. We give some examples of computable formal contexts in which the computable formal concepts fail to form a lattice and study the complexity aspects of formal concepts in computable contexts. In particular, we give some sufficient conditions under which the computability or noncomputability of a formal concept could be recognized from its lattice-theoretic properties. We prove the density theorem showing that in a Cantor-like topology every formal concept can be approximated by computable ones. We also show that not all formal concepts have lattice-theoretic approximations as suprema or infima of families of computable formal concepts.     

The Degree Spectra of Definable Relations on Boolean Algebras

We study some questions concerning the structure of the spectra of the sets of atoms and atomless elements in a computable Boolean algebra. We prove that if the spectrum of the set of atoms contains a 1-low degree then it contains a computable degree. We show also that in a computable Boolean algebra of characteristic (1, 1, 0) whose set of atoms is computable the spectrum of the atomless ideal consists of all Π ₀ ² degrees.Original Russian Text Copyright © 2005 Semukhin P. M.The author was supported by the Russian Foundation for Basic Research (Grant 02-01-00593), the Leading Scientific Schools of the Russian Federation (Grant NSh-2112.2003.1), and the Program “Universities of Russia” (Grant UR.04.01.013).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 928–941, July–August, 2005.     

Estimation of the algorithmic complexity of classes of computable models

We estimate the algorithmic complexity of the index set of some natural classes of computable models: finite computable models (Σ ₂ ⁰ -complete), computable models with ω-categorical theories (Δ _ω ⁰ -complex Π _ω+2 ⁰ -set), prime models (Δ _ω ⁰ -complex Π _ω+2 ⁰ -set), models with ω ₁-categorical theories (Δ _ω ⁰ -complex Σ _ω+1 ⁰ -set. We obtain a universal lower bound for the model-theoretic properties preserved by Marker’s extensions (Δ _ω ⁰ .     

On Homeomorphisms of Effective Topological Spaces

We study effective presentations and homeomorphisms of effective topological spaces. By constructing a functor from the category of computable models into the category of effective topological spaces, we show in particular that there exist homeomorphic effective topological spaces admitting no hyperarithmetical homeomorphism between them and there exist effective topological spaces whose autohomeomorphism group has the cardinality of the continuum but whose only hyperarithmetical autohomeomorphism is trivial. It is also shown that if the group of autohomeomorphisms of a hyperarithmetical topological space has cardinality less than 2 then this group is hyperarithmetical. We introduce the notion of strong computable homeomorphism and solve the problem of the number of effective presentations of T ₀-spaces with effective bases of clopen sets with respect to strong homeomorphisms.     

Computable Structure and Non-Structure Theorems

In a lecture in Kazan (1977), Goncharov dubbed a number of problems regarding the classification of computable members of various classes of structures. Some of the problems seemed likely to have nice answers, while others did not. At the end of the lecture, Shore asked what would be a convincing negative result. The goal of the present article is to consider some possible answers to Shore's question. We consider structures of some computable language, whose universes are computable sets of constants. In measuring complexity, we identify with its atomic diagram D(), which, via the Gödel numbering, may be treated as a subset of . In particular, is computable if D() is computable. If K is some class, then K^c denotes the set of computable members of K. A computable characterization for K should separate the computable members of K from other structures, that is, those that either are not in K or are not computable. A computable classification (structure theorem) should describe each member of K^c up to isomorphism, or other equivalence, in terms of relatively simple invariants. A computable non-structure theorem would assert that there is no computable structure theorem. We use three approaches. They all give the correct answer for vector spaces over Q, and for linear orderings. Under all of the approaches, both classes have a computable characterization, and there is a computable classification for vector spaces, but not for linear orderings. Finally, we formulate some open problems.     

The categoricity of the group of all computable automorphisms of the rational numbers

We prove that there is a first-order sentence ϕ such that the group of all computable automorphisms of the ordering of the rational numbers is its only model among the groups that are embeddable in the group of all computable permutations. Supported by a Scheme 2 grant from the London Mathematical Society. __________ Translated from Algebra i Logika, Vol. 46, No. 5, pp. 649–662, September–October, 2007.     

Infinite Time Turing Machines With Only One Tape

Infinite time Turing machines with only one tape are in many respects fully as powerful as their multi‐tape cousins. In particular, the two models of machine give rise to the same class of decidable sets, the same degree structure and, at least for partial functions f : ℝ → ℕ, the same class of computable functions. Nevertheless, there are infinite time computable functions f : ℝ → ℝ that are not one‐tape computable, and so the two models of infinitary computation are not equivalent. Surprisingly, the class of one‐tape computable functions is not closed under composition; but closing it under composition yields the full class of all infinite time computable functions. Finally, every ordinal that is clockable by an infinite time Turing machine is clockable by a one‐tape machine, except certain isolated ordinals that end gaps in the clockable ordinals.     

Spectra of computable models for Ehrenfeucht theories

We construct an example of a theory with a finite (greater than one) number of isomorphism types of countable models such that its prime and saturated models have computable presentations and there exists a model which lacks in such. Supported by the Council for Grants (under RF President) and State Aid of Fundamental Science Schools via project NSh-4413.2006.1. __________ Translated from Algebra i Logika, Vol. 46, No. 3, pp. 275–289, May–June, 2007.     

Positive undecidable numberings in the Ershov hierarchy

A sufficient condition is given under which an infinite computable family of Σ^-1 _a -sets has computable positive but undecidable numberings, where a is a notation for a nonzero computable ordinal. This extends a theorem proved for finite levels of the Ershov hierarchy in [1]. As a consequence, it is stated that the family of all Σ^-1 _a -sets has a computable positive undecidable numbering. In addition, for every ordinal notation a > 1, an infinite family of Σ^-1 _a -sets is constructed which possesses a computable positive numbering but has no computable Friedberg numberings. This answers the question of whether such families exist at any—finite or infinite—level of the Ershov hierarchy, which was originally raised by Badaev and Goncharov only for the finite levels bigger than 1.     

Is wave propagation computable or can wave computers beat the turing machine?

According to the Church-Turing Thesis a number function is computableby the mathematically defined Turing machine if and only ifit is computable by a physical machine. In 1983 Pour-El andRichards defined a three-dimensional wave u(t,x) such that theamplitude u(0,x) at time 0 is computable and the amplitude u(1,x)at time 1 is continuous but not computable. Therefore, theremight be some kind of wave computer beating the Turing machine.By applying the framework of Type 2 Theory of Effectivity (TTE),in this paper we analyze computability of wave propagation.In particular, we prove that the wave propagator is computableon continuously differentiable waves, where one derivative islost, and on waves from Sobolev spaces. Finally, we explainwhy the Pour-El-Richards result probably does not help to designa wave computer which beats the Turing machine. 2000 Mathematical Subject Classification: 03D80, 03F60, 35L05,68Q05.     

Computability of measurable sets via effective topologies

We investigate in the frame of TTE the computability of functions of the measurable sets from an infinite computable measure space such as the measure and the four kinds of set operations. We first present a series of undecidability and incomputability results about measurable sets. Then we construct several examples of computable topological spaces from the abstract infinite computable measure space, and analyze the computability of the considered functions via respectively each of the standard representations of the computable topological spaces constructed. The authors are supported by grants of NSFC and DFG.     

Σ-Definability of countable structures over real numbers, complex numbers, and quaternions

We study Σ-definability of countable models over hereditarily finite {ie193-01} superstructures over the field ℝ of reals, the field ℂ of complex numbers, and over the skew field ℍ of quaternions. In particular, it is shown that each at most countable structure of a finite signature, which is Σ-definable over {ie193-02} with at most countable equivalence classes and without parameters, has a computable isomorphic copy. Moreover, if we lift the requirement on the cardinalities of the classes in a definition then such a model can have an arbitrary hyperarithmetical complexity, but it will be hyperarithmetical in any case. Also it is proved that any countable structure Σ-definable over {ie193-03}, possibly with parameters, has a computable isomorphic copy and that being Σ-definable over {ie193-04} is equivalent to being Σ-definable over {ie193-05}. Supported by RFBR-DFG, grant No. 06-01-04002 DFGa. __________ Translated from Algebra i Logika, Vol. 47, No. 3, pp. 335–363, May–June, 2008.