Computational Diversity - comp.lang.lisp

Допис з розмови Computational Diversity

sv0f

Переглянути профіль

Більше налаштувань 29 Чер 2003, 18:30

Групи новин: comp.lang.lisp

Від: sv0f <n...@vanderbilt.edu>

Дата: Sun, 29 Jun 2003 10:27:54 -0500

Місцевий час: Нд 29 Чер 2003 18:27

Тема: Re: Computational Diversity

  Переслати | Друк | Дивитися гілку
  | Показати оригінал
  | Повідомити адміністраторів про це повідомлення | Знайти повідомлення від цього автора
  

In article <ca167c61.0306290554.1ada4...@posting.google.com>,
carh...@yahoo.com (c hore) wrote:

>That is, if you are building some critical piece of
>software, e.g., for flight control, that computes some
>result, you get N persons or groups to code N versions,
>same or different language, algorithm, whatever.

>If N=2 and the result differs, then you won't know
>which to believe, but at least you will know that
>at least one program could have a bug. If N=3, then you
>can vote as in the famous TMR (Triple Modular Redundancy)
>approach to hardware fault tolerance.

In Triple Modular Redundancy, are there feedback-based
mechanisms for learning over time? That is, if one
program is consistently overruled by the other two, is
there some weight on its contribution that's adjusted
downward, is it swapped out when a replacement program
becomes available, etc?

Or is its divergent perspective valued and kept around
solely for the contrarian outputs it contributes?

Переслати