Infimums of step-counting functions of enumeration of sets

DOI10.1007/BF01141626MaRDI QIDQ1170187zbMATH OpenFDO

Authors A. S. Barashko

Publication date 1981

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01141626

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

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• On complexity properties of recursively enumerable sets
• On degrees of unsolvability and complexity properties
• Speed-Ups by changing the order in which sets are enumerated
• Toward a Theory of Enumerations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1170187)