Intrinsic computability over algebraic structures
نویسندگان
چکیده
The notion of computable function can be extended from the natural numbers to other domains, using an indexing. Usually, the choice of the indexing affects the set of computable functions and there is no intrinsic notion of computability over these domains. In this paper, we show that, in contrast, when we extend the notion of computable function to algebraic structures, we obtain an intrinsic notion in many cases. We give examples of such structures having an intrinsic notion of computability and characterize them as finitely generated
منابع مشابه
Computability of String Functions over Algebraic Structures ( Preliminary Version )
We present a model of computation for string functions over single{sorted, total algebraic structures and study some features of a general theory of computability within this framework. Our concept generalizes the Blum{Shub{Smale setting of computability over the reals and other rings. By dealing with strings of arbitrary length instead of tuples of xed length, some suppositions of deeper resul...
متن کاملEffective cartesian closed categories of domains
Perhaps the most important and striking fact of domain theory is that important categories of domains are cartesian closed. This means that the category has a terminal object, finite products, and exponents. The only problematic part for domains is the exponent, which in this setting means the space of continuous functions. Cartesian closed categories of domains are well understood and the unde...
متن کاملA Useful Undecidable Theory
We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since such structures appear naturally in some parts of computability theory, we obtain several new undecidability results. This applies e.g. to the structures of complete numberings, of m-degrees of index sets and of the Wadge degrees ...
متن کاملComputable Isomorphisms, Degree Spectra of Relations, and Scott Families
In studying effective structures we investigate the effective content of typical notions and constructions in many branches of mathematics including universal algebra and model theory. In particular, we are interested in the possibilities of effectivizing model–theoretic or algebraic constructions and the limits on these possibilities. For instance, we try to understand whether certain results ...
متن کاملP versus NP and computability theoretic constructions in complexity theory over algebraic structures
We show that there is a structure of countably infinite signature with P = N2P and a structure of finite signature with P = N1 P and N1 P N2P. We give a further example of a structure of finite signature with P : NIP and N1 P $ N2P. Together with a result from [10] this implies that for each possibility of P versus NP over structures there is an example of countably infinite signature. Then we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009