Algorithms for Constructing Computably Enumerable Sets

DOI10.1007/978-3-031-26904-2MaRDI QIDQ6114449zbMATH OpenOpenAlexFDO

Authors Kenneth J. Supowit

Publication date 11 July 2023

Published in Computer Science Foundations and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-26904-2

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Recursively (computably) enumerable sets and degrees (03D25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Nonnumerical algorithms (68W05)

Cited in

(5)

• An algorithm for enumerating difference sets
• Algorithmic construction of sets for k -restrictions
• scientific article; zbMATH DE number 1052824 (Why is no real title available?)
• scientific article; zbMATH DE number 1163992 (Why is no real title available?)
• An algorithm for enumerating all infinite repetitions in a D0L-system

This page was built for publication: Algorithms for Constructing Computably Enumerable Sets

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