07 December 2010
06 December 2010
Reflections
The Epilogue section of Dennis Shasha's and Cathy Lazere's book Out of Their Minds: The Lives and Discoveries of 15 Great Computer Scientists starts with a question - "What qualities of personality and intellect make great computer scientists?" (243). The authors go on to discuss all the similarities, differences, and peculiarities of each of the fifteen computer scientists they wrote about in their book. Some are very different, some are very similar, and some are truly very unique. As I finish this book, I would like to take note of all the qualities of personality and intellect I thought were emphasized in Out of Their Minds and reflect on them as key to success in science, mathematics, computer science, and engineering. Here is what I have so far:
- Technical and Curious: A love of the mathematics and the sciences is a necessity - one that cannot be overlooked.
- Industrious and Flexible: The ability to give it your all 110% of the time is extremely important in this discipline. Then, adapting to the always changing landscape of the discipline quickly becomes crucial in being successful, and after you've adapted, it is time to give your 110% again.
- Accurate and Presice: Attention to detail is key in many respects - from simply doing research to developing very large-scale systems with a vast amount of necessary detail.
- Focused and Goal-Oriented: Research and development can often be very frustrating. Therefore, an exceptional amount of dedication is required in order to succeed in science.
- Ethical and Aware: Technologies created by engineers and scientists always have alternate impacts on a lot of people. Considering the state of the society during technological development will help create a better and more peaceful world for all of us.
- Team Player: Engineers clearly never work alone. Understanding your team and keeping open lines of communication while staying on task will always make the job easier and more fun.
- Risk Taker: Science and engineering are all about taking risks, so a successful scientists will learn to do this quickly, as this is the process by which a lot of theses are formulated and a lot of cool, useful things are discovered.
- Lucky: Being in the right place in the right time never hurt anyone. For some of the fifteen great computer scientists the book discussed, luck is exactly what made their careers.
28 November 2010
27 November 2010
The Winner of a Twenty-Year Bet
From a very early age, science has been an outlet for curiosity for Douglas B. Lenat, born in Philadelphia in 1950, and fortunately for Lenat, science is a theme that resonated throughout his life. Although he did not receive very good primary education, he had a natural talent. In 1967, for example, he became a finalist in an International Science Fair for his work on the closed form definition of the nth prime number which was judged by a company of scientists, researchers, and engineers. In 1968, Lenat entered the University of Pennsylvania initially pursuing a degree in physics and mathematics. He quickly changed his mind however after taking a course in 1971 with John W. Carr III, a computer science professor at the University of Pennsylvania who had introduced Lenat to artificial intelligence. The research in the field was just starting out, so Lenat decided to pursue it. In 1972, he attended CalTech for a PhD program in applied mathematics and computer science but promptly realized that a lot of work on artificial intelligence at the time was done at Stanford, so he transferred in order to begin his work with McCarthy. Unfortunately, McCarthy left on sabbatical for MIT the same fall that Lenat arrived at Stanford, so instead, Lenat ended up working with Cordell Green on the theory of automatic programming that tested falsifiable hypotheses. Falsifiable hypotheses were an extremely important part of artificial intelligence because AI has to "interact directly with the external world" (228). Therefore, purely mathematical or logic predictions about these expert systems have to be tested. Lenat also applied these theories, and all the heuristics theories, to his doctoral thesis - a modest Lisp program that worked out various mathematical concepts named Automated Mathematician (AM); to this day, this thesis remains "one of the most original AI programs ever written" (229). After he had received his PhD in 1976, Lenat developed on AM with a project named Eurisko which brought a lot of interesting applications - including circuit design and minimization, solutions to tactical game problems, and searches for missed loopholes in game situations - to the table but never took off in the markets because it could not be extended to other various useful domains. In 1984, Lenat left the academia to pursue a business opportunity embodies by the project Cyc, a piece of artificial intelligence which possesses a large part of the entire existing body of knowledge. A lot of research, design, and implementation have been put into the project, but its success have yet to be seen. The project is currently considered to be one of the most controversial in the discipline, yet Lenat still "believes that AI projects like Cyc can become 'knowledge utilities'" in the future (242). Social reception of the technology cannot yet be considered; a much better question is - will Cyc actually work? According to Shasha and Lazere, yes, but only in part, due to various flaws in the current approach to expert systems and lack of understanding of the inner workings of the human mind. With all this evidence in mind, it is clear why Lenat remains "the boldest kind" of explorer of artificial intelligence leading the way to a bright future in the world of computing (242)."How many people have in their lives a 2 to 10 percent chance of dramatically affecting the way the world works? When one of those chances comes along, you should take it."- Douglas Lenat
26 November 2010
The Keeper of the Power of Knowledge
Edward A. Feigenbaum's story begins with a tragedy. He was born in Weehawken, NJ in 1936, and just before his first birthday, his father tragically passed away. Feigenbaum's stepfather, an accountant of a small local bakery, was in turn charged with the job to ignite his interest in science and technology, and so he did by taking young Feigenbaum to the Hayden Planetarium in New York City once a month to all the new exhibits. In 1952, Feigenbaum started his college career at the Carnegie Institute of Technology (now known as Carnegie Mellon University) majoring in electrical engineering, per his parents' request. Computer science did not yet exist for the average undergraduate at Carnegie, so Feigenbaum "began taking courses at Carnegie's then new Graduate School of Industrial Administration" (210). These courses, via professor James March, were the first to introduce him to the ideas of game theory and a lot of other work done by a Hungarian mathematician John von Neumann. Feigenbaum also had a rare opportunity to attend a course read by Herbert Simon, a professor at Carnegie in the fields of political science, sociology, and economics, as well as a former federal administrator for the Marshall Plan, on mathematical models in social sciences. One day,"There are three important things that go into building a knowledge-based system: knowledge, knowledge, knowledge. The competence of a system is primarily a function of what the system knows as opposed to how well it reasons."- Edward Feigenbaum
Simon, and his co-lecturer Allen Newell, announced that they had invented "a thinking machine" called "the Logic Theorist" and handed out user manuals for the IBM 701 (211). Feigenbaum took the manual home, read it, and finally realized what he wanted to do. The idea of the Logic Theorists was interesting: the "...program attempted to discover proofs in propositional logic" based on some other logic that is already known to the program using educated guessing problem-solving technique formally called a heuristic by a Hungarian mathematician George Polya (212). Fascinated by these ideas, Feigenbaum stayed at Carnegie with the School of Industrial Administration until 1956 when he graduated with his PhD in electrical engineering. His doctoral thesis involved more work with the Logic Theorist as he attempted to further model human problem-solving abilities, such that he could draw some conclusions about human problem solving. It turned out to be a very hard problem, but it was completed under the name Elementary Perceiver and Memorizer (EPAM), and it is still used today at Carnegie Mellon. More specifically, the program modeled how humans are able to memorize pairs of unrelated, nonsense words in a stimulus-response setting. The process included a training portion and a testing portion, and from a psychology standpoint, provided a lot of insights into the working and abilities of short-term memory. This research lead Feigenbaum first to the University of California at Berkeley and then, eventually, to Stanford where John McCarthy was doing his work with artificial intelligence in 1965. At Stanford, Feigenbaum began to formulate his thoughts about expert systems. In a collection of papers Computers and Thoughts that he co-edited with a colleague Julian Feldman, he first began advocating for further exploration of computer-based processes of induction. In 1964, Feigenbaum, Joshua Lederberg, the chairman of the Stanford genetics department, and a Stanford chemist Carl Djerassi, began their work on a joint project Dendral which attempted to develop a "Mars probe that would land on the surface of the red planet and explore for life or precursor molecules" (216). The project, which a year later had been declared successful, is considered to be the the world's first true expert system capable of determining chemical structure of molecules even better than most humans could. This project also laid out the framework for expert systems in general: "a set of data, a set of hypotheses, and a set of rules to choose among the hypotheses" (218). Soon, the company developed all kinds of other expert systems including Mycin, which was meant to help doctors diagnose infectious diseases and recommend treatment to numerous patients, and airline management systems, which supported airport traffic controllers. In the end, the idea of standardized knowledge turned out to be key to the expert system structure. The more knowledge exists in the system, the better, more efficient, and simply smarter the expert system can be. Despite the extensive work that Feigenbaum did in this area, expert systems are in their developing stages in the world of computer science, but even Feigenbaum himself believes that "the expert system will gain its rightful place as an intelligent agent that can cooperate with people to solve some of the world's more challenging problems" (222).
23 November 2010
The Biologist of Computing
W. Daniel Hillis's interests in science and technology came from his parents. His father was an epidemiologist while his mother was very interested in mathematics, and both his parents went to great lengths to instill curiosity in these subjects. Hillis's curiosity and craftiness enhanced his experience with technology during his youth. His first real exposure to the world of digital computing was in the late 1960s when he had the chance to look at George Boole's An Investigation of the Laws of Thought (1854) which outlined the principles of elementary Boolean algebra. After toying with these ideas, he eventually learned to program. In 1974, however, he entered MIT "determined to find out how the brain worked" planning to major in neurophysiology (192). At MIT, Hillis met Marvin Minsky and John McCarthy and fully discovered the vast world of computing and started working at MIT's Artificial Intelligence lab in the LOGO group on a project involving computer technologies that followed the evolutionary principle of emergence which states that "interacting agents will adapt, through a process of selection, a mechanism for survival" (193). Soon, Hillis' idea for the Connection Machine was born. In attempt to mimic the massive parallelism used by the brain, the Connection Machine was designed to be a computer made up of thousands of processors all linked together each with its own control and its own memory. The machine was connected, initiated, and set "free" to run in hopes to discover the emergence of new smarter technology from the pre-existing one. A perfect project for a lover of both biology and computing, the Connection Machine was the perfect project for Hillis, but it is clear that the Machine is only the beginning to our understanding of evolutionary trends in computing."Clearly, the organizing principle of the brain is parallelism. It's using massive parallelism. The information is in the connection between a lot of very simple parallel unit working together. So, if we built a computer that was more along that system of organization, it would likely be able to do the same kinds of things the brain does."- Daniel Hillis
22 November 2010
The Driver of the Digital Fast Lane
Burton J. Smith's career had a very rough start. Smith, born in 1941 in Chapel Hill, NC, moved with his family to New Mexico when his father, a professor of chemistry, was offered at job as the head of the University of New Mexico's chemistry department. Smith was constantly fascinated by technology, but only after he came back from the military did he know what exactly he wanted to do - design of electronic devices. Therefore, he graduated in 1968 with a B.S. in electrical engineering from the University of New Mexico and went on to MIT where he completed his doctorate in 1972. A lot of Smith's work from then on was focused on optimizing the hardware structures that support the newly implemented pipelining process - both pipeline parallelism and multiprocessor parallelism - used in computation. Smith and his colleagues at Denelcor, a small computing company based in Denver, Colorado, strove to create a supercomputer which would employ high-efficient parallel processing. In other words, they wanted "to design a machine that would perform and operation as soon as its inputs were ready" (180). They called this approach, which was first developed by Jack Dennis of MIT in the 1970s, "dataflow architecture" (180). After some time in development, it was clear that this approach has a very significant impact on the discipline, as dataflow architecture is also applied to digital memories and networks of all kinds, just to name a few. Smith's success eventually followed him to the Tera Computer Company in Seattle, WA where he had another revelation that boosted performance of the pipelining process - "different operations within a task may sometimes be executed out of order" (186). This idea significantly sped up data processing in computers and ultimately led us to the modern-day process."Speed is exchangeable for almost anything.
Any computer can emulate any other at some speed."
- Burton Smith
21 November 2010
The Inventor with a Delight in Making Things Work
With great abilities and interest in engineering and science, Frederick P. Brooks, Jr., born in Durham, NC in 1931, started his career at Duke University with a double major in physics and mathematics. He graduated in 1953 and realized that he was much more drawn to "a younger field" than physics, so he decided to pursue computer science. He did so at Harvard University under the leadership of Howard Aiken, a pioneer in computing and one of the original designers of the Harvard Mark I computer used during wartime to calculate "the trajectories of battleship artillery shells based on" various criteria (162). He graduated in 1956 and joined IBM to work on what was then considered an "extremely ambitious" project called the Stretch computer, the world's fastest (at the time) supercomputer that utilized many of the same concepts that are used to implement modern computer architecture (163). Eventually, Brooks became the project manager of the development of the IBM System/360 line of computers. As a part of that project, he and his team received the opportunity to research and improve the OS/360 software package which was used on the system. A direct descendant of the OS/360 now runs on the majority of the big IBM mainframes. In 1964, Brooks returned to his home state upon receiving a job opportunity at the University of North Carolina in Chapel Hill where he founded the Department of Computer Science, which at the time was the second one in the entire nation, that same year. The department focuses its research efforts on three-dimensional, real-time computer graphics, computer vision, and virtual reality. In other words, it is what Brooks calls "intelligence amplification," and he explains:"It is better to take a driving problem that issomeone else's problem, because it keeps you honest."
- Frederick Brooks
"The artificial intelligence approach is to replace the mind. Our approach is always to have the mind at the very center of the system. Now the artificial intelligence community has come around to this idea after twenty-five years. But that wasn't where they started out. They used to say, 'We're going to be able to solve these problems. You don't need a mind.' In fact, you do need a mind."His approach may not be a conventional, but it is certainly a good one, and Brooks is right - people will probably always be better than computers in terms of intelligence. The research to make them smarter continues, but we must never forget that computers are only tools for people to use and there are always much more important things to consider.
20 November 2010
The Investigator of Time, Space, and Computation
"A distributed system is one in which the failure of a computer you didn't even know existed can render your own computer unusable."
- Leslie Lamport
16 November 2010
The Seeker of Good Structure
Robert E. Tarjan, born in Pomona, CA in 1948, is the generator of "good ideas", and he managed to come up with quite a few of them through his remarkable career in computer science. Interested in science and mathematics from a very early age, Tarjan was always a big fan of precise and rigorous proofs and, in high school, would often doubt his professors if they did not completely explain the reasoning behind their math. This mindset led Tarjan first to Caltech, then to Stanford which he graduated in 1972 with a PhD in computer science and a minor in mathematics. This doctoral thesis and most of his early work focused on graph-based planarity algorithms, which led Tarjan to the research and development of depth-first search algorithms and the data structures that stem from these. Tarjan's latest work was in the development of persistent data structures "in which you can keep track of previous versions as well as most recent version" of state systems and "do [so] efficiently, without copying [] entire data structure[s]" of data every time the program runs (117). Persistent data structures allow for the development of recently discovered applications in computational geometry and parallel processing called temporal databases which "are designed to recreate snapshots of the past quickly and efficiently" (118). All the numerous algorithms that Tarjan had the opportunity to work on embody his legacy while he continues his work in computer science, with some advice to present-day programmers: "What do you need to be successful? You need brains but you also need stick-to-itiveness. Many tries at a solution can fail, but then on the last try something magical happens," and that magical phenomenon is worth it - every time (119)."I visualize structures, graphs, data structures.
It seems to come easier than a lot of other things."
- Robert Tarjan
The Capturer of the Boundless Interest
Even Shasha and Lazere wonder if Donald E. Knuth, born in 1938 in Milwaukee, WI, is "just one person" (89). Knuth's career officially started in 1957 when his first piece for the Westinghouse Science Talent Search on the "potrzebie system of weights and measures" was published in the Mad Magazine. He was only 19 years old at the time and still had no idea that he might be interested in computing. He studied mathematics during his undergraduate years at Case Western Reserve in Cleveland, Ohio, which is also where he taught himself basic programming skills. In 1960, he graduated from Case receiving a master's degree in mathematics at the same time and went on to California Institute of Technology for a PhD in the same field. After completing his PhD work, Knuth stayed as a member of the Caltech faculty now working closely with the Burroughs Corporation, alongside Dijkstra and other pioneers in the field, on hardware and software efficient problems for new-found programming languages like Algol 60. First, Knuth's work focused on compilers. More specifically, he worked on many of the tools used today to write compilers (and yes, because of Knuth, all computer science majors today have to take a compilers course at some point during their undergraduate careers). His work in this area was the perfect segue into his later work on more specific parsing problems and attribute grammars. His early work with attribute grammars branched from the recently discovered Backus-Naur form and other grammar interpretation algorithms while his later work dealt with precise analysis and automation of problem solving the results of which included the famous Knuth-Bendix algorithm on axiom-based confluent term rewriting systems. All of Knuth's work has been described comprehensively and completely in a 7-volume publication The Art of Computer Programming which, to this day, remains Knuth's legacy and his biggest contribution to the field of computer science."Computer programming is an art form, like the creation of poetry or music."- Donald Knuth
13 November 2010
RSA Encryption
11 November 2010
The Proponent of the Possibilities of Chance
We should give up the attempt to derive results and answer with complete certainty.
- Michael O. Rabin
10 November 2010
The Inventor of the Appaling Prose and the Shortest Path
"I asked my mother [a mathematician] whether mathematics was a difficult topic. She said to be sure to learn all the formulas and be sure you know them. The second thing to remember is if you need more than five lines to prove something, then you're on the wrong track."
- Edsger Dijkstra
- Never compete with colleagues.
- Try the most difficult thing you can do.
- Choose what is scientifically healthy and relevant. Don't compromise on scientific integrity."
Subscribe to:
Posts (Atom)