کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
421983 684999 2008 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Stability for Effective Algebras
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Stability for Effective Algebras
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 221, 25 December 2008, Pages 3-15