Infimums of step-counting functions of enumeration of sets

DOI10.1007/BF01141626zbMath0497.03030MaRDI QIDQ1170187

A. S. Barashko

Publication date: 1981

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

abstract complexitycomplexity of enumerationexact lower bound on complexitytape complexity

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• On complexity properties of recursively enumerable sets
• On degrees of unsolvability and complexity properties
• Toward a Theory of Enumerations
• Speed-Ups by changing the order in which sets are enumerated
• Unnamed Item

This page was built for publication: Infimums of step-counting functions of enumeration of sets