On Reliable Networks from Unreliable Gates

@inproceedings{Uhlig1987OnRN,
  title={On Reliable Networks from Unreliable Gates},
  author={Dietmar Uhlig},
  booktitle={Parallel Algorithms and Architectures},
  year={1987}
}
The study of networks with small error probability was insugurated by J.v. Neumann in ~] in 1952. Assume there is a complete set of (unreliable) gates with error probability ~ smeller than 1/2. One of the central results in this field (argued heuristically by yon Neumann and proved rigorously by R.L. Dobrushin and S.i. Ortyukov [5~ in 1977) is the following: Let ~be any (extremely small) positive constsnt. Further let A be a network realizing Boolean function f provided no gate has failed. (The… CONTINUE READING

From This Paper

Topics from this paper.
2 Citations
6 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-6 of 6 references

0 rtyukov : On the Lower Bound for Redundsncy of Self - Correcting Networks of Unrelisble Punctionsl Elements

  • R. L. end S. I. Dobrushin
  • Prob . Peredecl Informecii
  • 1977

0 rtyukov : Upper Bound for Redundsncy of SelfCorrectlng Arrengements of Unrelisble Punctionel Elements

  • I. S.
  • Prob of Info Trensm .
  • 1977

On the Synthesis of Asymptotically Non - redundant Self - Correcting Networks of Unreliable Functional Elements

  • G. I. Eirienko
  • Prob . Pereds
  • 1977

Synthesis of Combinatorial Networks which are Self-Correcting Referring to s Growing Number of Errors

  • G. I. l Eirienko
  • Diskrenij snsliz, Sb. Trudov IM SI AN SSSR
  • 1970

On a Method of Synthesis of Networks

  • B. LupsnovO.
  • Izv . Vyss . U ~ ebno Zeved
  • 1958

Probsbilistic Logic of Relisble Organism from Unreliable Components

  • C. E. Shsnnon end J. Mc Csrthy
  • Automata studies

Similar Papers

Loading similar papers…