Sequential and parallel enumeration

DOI10.1007/BF03186488MaRDI QIDQ1312715zbMATH OpenOpenAlexFDO

Authors Franz Stetter

Publication date 18 July 1994

Published in Mathematische Semesterberichte (Search for Journal in Brave)

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

zbMATH Keywords

countabilityparallel computationsparallel enumerationsequential enumeration

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Review text

The notion of an enumeration is extended to that of a parallel enumeration. An enumeration \(f(0),f(1),f(2),\dots\) of a set is actually a sequential enumeration. If one allows for parallel computations, then, so the author claims, uncountable sets can be so enumerated. For instance, the power set of the natural numbers, as the paths through the binary branching tree, is generated by constructing the binary tree by having each node generate its two children as two parallel sub-processes.

Recommendations

• Parallel enumeration of degree sequences
• Enumeration and automatic sequences
• scientific article; zbMATH DE number 4195879
• scientific article; zbMATH DE number 1286135
• scientific article; zbMATH DE number 3991266
• scientific article; zbMATH DE number 1092946
• scientific article; zbMATH DE number 3860373
• Listing combinatorial objects in parallel
• Enumeration and random generation of concurrent computations

Cited in

(4)

• Fast, flexible MUS enumeration
• ASCA, SASCA and DPA with Enumeration: Which One Beats the Other and When?
• Parallel enumeration of degree sequences
• On mutually coherent enumerations of countable sets

This page was built for publication: Sequential and parallel enumeration

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