Index Sets of Constructive Models that are Autostable Under Strong Constructivizations

We obtain estimates for the algorithmic complexity of index sets for the class of decidable autostable models and the class of computable models that possess strong constructivizations and are autostable under strong constructivizations.

Saved in:
Bibliographic Details
Published in:Journal of mathematical sciences (New York, N.Y.) N.Y.), 2015-03, Vol.205 (3), p.368-388
Main Authors: Goncharov, S. S., Marchuk, M. I.
Format: Article
Language:English
Subjects:
Mathematics
Mathematics and Statistics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We obtain estimates for the algorithmic complexity of index sets for the class of decidable autostable models and the class of computable models that possess strong constructivizations and are autostable under strong constructivizations.
ISSN:1072-3374
1573-8795
DOI:10.1007/s10958-015-2253-4