Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 6 of 6

Full-Text Articles in Physical Sciences and Mathematics

Recounting The Odds Of An Even Derangement, Arthur T. Benjamin, Curtis D. Bennet, Florence Newberger Dec 2005

Recounting The Odds Of An Even Derangement, Arthur T. Benjamin, Curtis D. Bennet, Florence Newberger

All HMC Faculty Publications and Research

No abstract provided in this article.


What's Best?, Arthur T. Benjamin, Matthew T. Fluet '99 Jun 2000

What's Best?, Arthur T. Benjamin, Matthew T. Fluet '99

All HMC Faculty Publications and Research

No abstract provided in this article.


A Rational Solution To Cootie, Arthur T. Benjamin, Matthew T. Fluet '99 Mar 2000

A Rational Solution To Cootie, Arthur T. Benjamin, Matthew T. Fluet '99

All HMC Faculty Publications and Research

No abstract provided in this article.


Optimization In Chemical Kinetics, Arthur T. Benjamin, Gordon J. Hogenson '92 Apr 1992

Optimization In Chemical Kinetics, Arthur T. Benjamin, Gordon J. Hogenson '92

All HMC Faculty Publications and Research

No abstract provided in this article.


The Bisection Method: Which Root?, Arthur T. Benjamin Nov 1987

The Bisection Method: Which Root?, Arthur T. Benjamin

All HMC Faculty Publications and Research

No abstract provided in this article.


Reliable Computation In The Presence Of Noise, Nicholas Pippenger Jan 1986

Reliable Computation In The Presence Of Noise, Nicholas Pippenger

All HMC Faculty Publications and Research

This talk concerns computation by systems whose components exhibit noise (that is, errors committed at random according to certain probabilistic laws). If we aspire to construct a theory of computation in the presence of noise, we must possess at the outset a satisfactory theory of computation in the absence of noise.

A theory that has received considerable attention in this context is that of the computation of Boolean functions by networks (with perhaps the strongest competition coming from the theory of cellular automata; see [G] and [GR]). The theory of computation by networks associates with any two sets Q and …