Kazan Federal University Digital Repository
Quasi-completeness and functions without fixed-points
- Home
- →
- Научные публикации в Scopus
- →
- Публикации сотрудников КФУ Scopus
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Batyrshin I. | |
| dc.date.accessioned | 2018-09-18T20:11:06Z | |
| dc.date.available | 2018-09-18T20:11:06Z | |
| dc.date.issued | 2006 | |
| dc.identifier.issn | 0942-5616 | |
| dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/137355 | |
| dc.description.abstract | We prove a completeness criterion for quasi-reducibility and generalize it to higher levels of the arithmetical hierarchy. As an application of the criterion we obtain Q-completeness of the set of all pairs (x, n) such that the prefix-free Kolmogorov complexity of x is less than n. © 2006 WILEY-VCH Verlag GmbH & Co. KGaA. | |
| dc.relation.ispartofseries | Mathematical Logic Quarterly | |
| dc.subject | Computability | |
| dc.subject | Functions without fixed-points | |
| dc.subject | Pre-fix-free Kolmogorov complexity | |
| dc.subject | Quasi-reducibility | |
| dc.subject | The arithmetical hierarchy | |
| dc.title | Quasi-completeness and functions without fixed-points | |
| dc.type | Article | |
| dc.relation.ispartofseries-issue | 6 | |
| dc.relation.ispartofseries-volume | 52 | |
| dc.collection | Публикации сотрудников КФУ | |
| dc.relation.startpage | 595 | |
| dc.source.id | SCOPUS09425616-2006-52-6-SID33846199470 |
Files in this item
This item appears in the following Collection(s)
-
Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.