On frequency-enumerable sets

DOI10.1007/BF01463139zbMath0319.02031OpenAlexW2011986958MaRDI QIDQ1222649

E. B. Kinber

Publication date: 1975

Published in: Algebra and Logic (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (1)

Resource Bounded Frequency Computations with Three Errors

Cites Work

• The Theory of Automata, a Survey
• Trial and error predicates and the solution to a problem of Mostowski
• Limiting recursion
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On frequency-enumerable sets