Stability for Effective Algebras | Zendy

Jens Blanck | Zendy; V. Stoltenberg-Hansen | Zendy; John V. Tucker | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Stability for Effective Algebras

Author(s) -

Jens Blanck,

V. Stoltenberg-Hansen,

John V. Tucker

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.12.002

Subject(s) - mathematics , subalgebra , limit (mathematics) , computable number , continuation , computable analysis , pure mathematics , limit point , stability (learning theory) , operator (biology) , discrete mathematics , algebra over a field , computable function , computer science , mathematical analysis , biochemistry , chemistry , repressor , machine learning , transcription factor , programming language , gene

We give a general method for showing that all numberings of certain effective algebras are recursively equivalent. The method is based on computable approximation-limit pairs. The approximations are elements of a finitely generated subalgebra, and obtained by computable (non-deterministic) selection. The results are a continuation of the work by Mal'cev, who, for example, showed that finitely generated semicomputable algebras are computably stable. In particular, we generalise the result that the recursive reals are computably stable, if the limit operator is assumed to be computable, to spaces constructed by inverse limits.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research