Sequential and parallel enumeration (Q1312715): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf03186488 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063278290 / rank
 
Normal rank

Latest revision as of 12:14, 30 July 2024

scientific article
Language Label Description Also known as
English
Sequential and parallel enumeration
scientific article

    Statements

    Sequential and parallel enumeration (English)
    0 references
    0 references
    0 references
    18 July 1994
    0 references
    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.
    0 references
    0 references
    countability
    0 references
    parallel enumeration
    0 references
    sequential enumeration
    0 references
    parallel computations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references