Creating order in sequence spaces with simple machines (Q751622): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Channel capacities for list codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4191951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3895387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal coding strategies for certain permuting channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3861131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3475204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5598243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematics, physics, and information (an editorial) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axioms and hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial structure and capacity of the permuting relay channel / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding theorems for individual sequences / rank
 
Normal rank

Latest revision as of 11:53, 21 June 2024

scientific article
Language Label Description Also known as
English
Creating order in sequence spaces with simple machines
scientific article

    Statements

    Creating order in sequence spaces with simple machines (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    We intend to open a new research field towards, say, a theory of ``creating order'' under various constraints. As a prototype of problems guiding our investigations we study here models involving sequence spaces. By ``creating order'' or equivalently ``organization'' we mean here reducing in size the range of outputs by an ``organizer'' via a permuting channel (a simple machine), when it is fed by a given domain of inputs. The ``creation of order'' is assumed to come alone from the permutation operation in these channels. Here, four types of ``order creation'' are considered depending on the structure of the knowledge of the organizer (limitations on mind) about the future input and past output sequences and the kinds of admissible permutations inside the channel (limitations on matter). In any case the organizers goal is to produce output spaces of minimal cardinality (optimal organization). We present here some strategies of ordering and some first and seemingly basic optimality results. After this more technical part of the paper we give some ideas about a general theory of ordering.
    0 references
    memory
    0 references
    entropy reduction
    0 references
    Maxwell's demon
    0 references
    creating order
    0 references
    sequence spaces
    0 references
    permuting channel
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references