Computability - Volume Preprint, issue Preprint

Purchase individual online access for 1 year to this journal.

Price: EUR 70.00

ISSN 2211-3568 (P)
ISSN 2221-3576 (E)

Computability is the journal of the association Computability in Europe. It is a peer reviewed international journal that is devoted to publishing original research of highest quality, which is centered around the topic of computability.

The subject is understood from a multidisciplinary perspective, recapturing the spirit of Alan Turing (1912-1954) by linking theoretical and real-world concerns from computer science, mathematics, biology, physics, computational neuroscience, history and the philosophy of computing.

Abstract: Two new characterizations of FO [ < , mod ] -definable sets, i.e. sets of integers definable in first-order logic with the order relation and modular relations, are provided. Those characterizations are used to prove that satisfiability of first-order logic over words with an order relation and a FO [ + ] -definable set that is not FO [ < , mod ] -definable is undecidable.

Abstract: This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is Δ 2 0 categorical. A structure A is said to be weakly ultrahomogeneous if there is a finite (exceptional ) set of elements a 1 , … , a n such that A becomes ultrahomogeneous when constants representing these elements are added to the language. Characterizations are obtained for weakly ultrahomogeneous linear orderings, equivalence structures, injection structures and trees,…and these are compared with characterizations of the computably categorical and Δ 2 0 categorical structures. Index sets are used to determine the complexity of the notions of ultrahomegenous and weakly ultrahomogeneous for various families of structures.
Show more

Abstract: Most of the physical processes arising in nature are modeled by differential equations, either ordinary (example: the spring/mass/damper system) or partial (example: heat diffusion). From the point of view of analog computability, the existence of an effective way to obtain solutions (either exact or approximate) of these systems is essential. A pioneering model of analog computation is the General Purpose Analog Computer (GPAC), introduced by Shannon [Journal of Mathematical Physics 20 (1941 ), 337–354] as a model of the Differential Analyzer and improved by Pour-El [Transactions of the American Mathematical Society 199 (1974 ), 1–28],…Lipshitz and Rubel [Proceedings of the American Mathematical Society 99 (2) (1987 )], Costa and Graça [Journal of Complexity 19 (5) (2003 ), 644–664] and others. The GPAC is capable of manipulating real-valued data streams. Its power is known to be characterized by the class of differentially algebraic functions, which includes the solutions of initial value problems for ordinary differential equations. We address one of the limitations of this model, which is its fundamental inability to reason about functions of more than one independent variable (the ‘time’ variable), as noted by Rubel [Advances in Applied Mathematics 14 (1) (1993 ), 39–50]. In particular, the Shannon GPAC cannot be used to specify solutions of partial differential equations. We extend the class of data types using networks with channels which carry information on a general complete metric space X ; here we take X = C ( R ) , the class of continuous functions of one real (spatial) variable. We consider the original modules in Shannon’s construction (constants, adders, multipliers, integrators) and we add a differential module which has one input and one output. For input u , it outputs the spatial derivative v ( t ) = ∂ x u ( t ) . We then define an X -GPAC to be a network built with X -stream channels and the above-mentioned modules. This leads us to a framework in which the specifications of such analog systems are given by fixed points of certain operators on continuous data streams. Such a framework was considered by Tucker and Zucker [Theoretical Computer Science 371 (2007 ), 115–146]. We study the properties of these analog systems and their associated operators, and present a characterization of the X -GPAC-generable functions which generalizes Shannon’s results.
Show more