Richard Feynman and the Connection Machine (1989)
blog.longnow.org
Richard Feynman and the Connection Machine (1989)
1–10 of 64 posts
Re: Richard Feynman and the Connection Machine (1989)
#2"By the end of that summer of 1983, Richard had completed his analysis of the behavior of the router, and much to our surprise and amusement, he presented his answer in the form of a set of partial differential equations. To a physicist this may seem natural, but to a computer designer, treating a set of boolean circuits as a continuous, differentiable system is a bit strange. Feynman’s router equations were in terms of variables representing continuous quantities such as “the average number of 1 bits in a message address.” I was much more accustomed to seeing analysis in terms of inductive proof and case analysis than taking the derivative of “the number of 1’s” with respect to time. Our discrete analysis said we needed seven buffers per chip; Feynman’s equations suggested that we only needed five. We decided to play it safe and ignore Feynman."
Re: Richard Feynman and the Connection Machine (1989)
#3Re: Richard Feynman and the Connection Machine (1989)
#4A nice essay. This paragraph stood out for me: "By the end of that summer of 1983, Richard had completed his analysis of the behavior of the router, and much to our surprise and amusement, he presented his answer in the form of a set of partial differential equations. To a physicist this may seem natural, but to a computer designer, treating a set of boolean circuits as a continuous, differentiable system is a bit st…
Lots of time is wasted trying to figure out how to get the rest of the company to communicate with the lone genius, and it's obvious that they're smart enough to go away for a week and learn enough of the field they're working in to try to use the language and vocabulary of that field to be minimally effective.
I've been on the receiving end of these kinds of analysis and the result is that they seem to exist purely to showcase how smart the individual is and to provide no other meaningful input to the effort. In this case the engineers ignored Feynman, did their own analysis anyways and followed their own conclusion...the subtext here is that multiple people were not getting along with Feynman's way of doing things.
He turned out right in the end of course, because Feynman, but there's lots of people who think they're Feynman and aren't and it's hard to tell the difference sometimes.
Re: Richard Feynman and the Connection Machine (1989)
#5A nice essay. This paragraph stood out for me: "By the end of that summer of 1983, Richard had completed his analysis of the behavior of the router, and much to our surprise and amusement, he presented his answer in the form of a set of partial differential equations. To a physicist this may seem natural, but to a computer designer, treating a set of boolean circuits as a continuous, differentiable system is a bit st…
Re: Richard Feynman and the Connection Machine (1989)
#6A nice essay. This paragraph stood out for me: "By the end of that summer of 1983, Richard had completed his analysis of the behavior of the router, and much to our surprise and amusement, he presented his answer in the form of a set of partial differential equations. To a physicist this may seem natural, but to a computer designer, treating a set of boolean circuits as a continuous, differentiable system is a bit st…
Feynman is great, very amusing and obviously brilliant. But I've also worked with folks like him before who end up as fish out of water in fields they don't know the conventions for and can't be bothered to learn. Lots of time is wasted trying to figure out how to get the rest of the company to communicate with the lone genius, and it's obvious that they're smart enough to go away for a week and learn enough of the f…
Re: Richard Feynman and the Connection Machine (1989)
#7Re: Richard Feynman and the Connection Machine (1989)
#8Re: Richard Feynman and the Connection Machine (1989)
#9As pointed out (in second para. of that section) Feynman's observation about representing a number as product of terms of the form $1 + 2^{-k}$ reduces the problem of estimating log to computing those values k which appear in the product. (Btw the article incorrectly claims the representation is unique.)
There's an obvious linear time algorithm for finding a sequence of values k but I don't think that would really perform so well compared to, say, Newton-Raphson.
So I wonder why this was a good approach. Perhaps there's a smart way to estimate the k or perhaps it just happened to fit the constraints under which they were working.
Anyone have some insights?
Re: Richard Feynman and the Connection Machine (1989)
#10Good but old: 1989. Should be stated in the title.