Blum, M.; Marques, I. On complexity properties of recursively enumerable sets. (English) Zbl 0335.02024 J. Symb. Log. 38(1973), 579-593 (1974). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 4 ReviewsCited in 23 Documents MSC: 03D25 Recursively (computably) enumerable sets and degrees 68Q25 Analysis of algorithms and problem complexity 03D20 Recursive functions and relations, subrecursive hierarchies × Cite Format Result Cite Review PDF Full Text: DOI References: [1] Theory of recursive functions and effective computability (1967) · Zbl 0183.01401 [2] DOI: 10.1145/321386.321395 · Zbl 0155.01503 · doi:10.1145/321386.321395 [3] DOI: 10.1145/321637.321648 · Zbl 0221.02016 · doi:10.1145/321637.321648 [4] Journal of the Association for Computing Machinery This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.