Re: Quantum Gravity 292.7: IBM and CalTech USA Use Fibonacci Numbers in Quantum Computer
- From: OsherD <mdoctorow@xxxxxxxxx>
- Date: Fri, 3 Oct 2008 19:25:06 -0700 (PDT)
On Oct 3, 1:22 pm, "Shurley" <inva...@xxxxxxxxxxxxxxx> wrote:
assignedrather than to its main alternative Conditional ProbabilityWrong
becauseWrong!
Fibonacci Numbers involve 2-step-back memory:
1) Fn = Fn-1 + Fn-2 (n a subscript) (beyond 1st few 0 and 1
values)Wrong!!. Google for it.
This Troll and Graffiti Artist invalid at invalid.invalid uses the
main troll/graffiti address invalid at invalid.invalid that attacks me
for years on sci.physics with most commons being one-worders or one-
liners with no substantiating support. Here the Troll makes one
"supporting" comment, namely "Google for it," to increase his/her
aleady negative credibility (except for the claim that fault tolerance
comes from memory errors instead of computer engineering reliability
theory - apparently he doesn't know the two branches of Computer
Science, mathematical and engineering). The Google suggestion, for
example, Wikipedia, produces what I said. As for Probable Causation/
Influence (PI) versus Conditional Probability, since I discovered the
former and compared it with the latter in peer-reviewed Publications
(see for example B. N. Kursunuglu et al (Eds.) Quantum Gravity,
Generalized Theory of Gravitation, and Superstring Theory-Based
Unification, Kluwer: N.Y. 2000, 89-97; and my paper in Electronic
Journal of Sociology 2005), the Troll/Graffiti Artist loses even more
credibility in babbling "Wrong!" without even knowing the theories!
Osher Doctorow
.
- References:
- Prev by Date: Re: An experiment to test the Emission Theory of light
- Next by Date: Re: "The Lorentz Transformation for Velocity"
- Previous by thread: Re: Quantum Gravity 292.7: IBM and CalTech USA Use Fibonacci Numbers in Quantum Computer
- Next by thread: conversation of momentum
- Index(es):
Relevant Pages
|
