This article is cited in 7 papers

Complexity properties of recursively enumerable sets and $sQ$-completeness

R. Sh. Omanadze

Tbilisi Ivane Javakhishvili State University, Ilia Vekua Institute of Applied Mathematics

Abstract: The notions of effectively subcreative set and strongly effectively acceleratable set are introduced. It is proved that the notions of effectively subcreative set, strongly effectively acceleratable set, and $sQ$-complete recursively enumerable set are equivalent.

UDC: 510

Received: 15.11.1995
Revised: 24.10.1996

DOI: 10.4213/mzm1624

 English version: Mathematical Notes, 1997, 62:3, 356–359

Bibliographic databases:

• 
• 
•