How Singular? How singular is the Singularity? Will it happen in an instant? Lets consider again the derivation of the word. In mathematics a singularity is a value that is beyond any limit - in essence, infinity. The Singularity as we have discussed it in this book, does not achieve infinite levels of computation, memory, as any other other measurable attribute. But it certainly achieves vast levels of all these qualities, including intelligence. With the reverse engineering of the human brain we will be able to apply the parallel, self-organizing, chaotic, algorithms of human intelligence to enormously powerful computational substrates. This intelligence will then be in a position to improve its own design, both hardware and software, in a rapidly accelerating iterative process.

For decades, proponents of artificial intelligence have argued that computers will soon be doing everything that a human mind can do. Admittedly, computers now play chess at the grandmaster level, but do they understand the game as we do? Can a computer eventually do everything a human mind can do? In this absorbing and frequently contentious book, Roger Penrose--eminent physicist and winner, with Stephen Hawking, of the prestigious Wolf prize--puts forward his view that there are some facets of human thinking that can never be emulated by a machine. Penrose examines what physics and mathematics can tell us about how the mind works, what they can't, and what we need to know to understand the physical processes of consciousness. He is among a growing number of physicists who think Einstein wasn't being stubborn when he said his "little finger" told him that quantum mechanics is incomplete, and he concludes that laws even deeper than quantum mechanics are essential for the operation of a mind. To support this contention, Penrose takes the reader on a dazzling tour that covers such topics as complex numbers, Turing machines, complexity theory, quantum mechanics, formal systems, Godel undecidability, phase spaces, Hilbert spaces, black holes, white holes, Hawking radiation, entropy, quasicrystals, the structure of the brain, and scores of other subjects. The Emperor's New Mind will appeal to anyone with a serious interest in modern physics and its relation to philosophical issues, as well as to physicists, mathematicians, philosophers and those on either side of the AI debate.

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. * Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page. * The number of exercises included has more than tripled. * Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.

A "skillful and literate" ( New York Times Book Review ) biography of the persecuted genius who helped create the modern computer. To solve one of the great mathematical problems of his day, Alan Turing proposed an imaginary computer. Then, attempting to break a Nazi code during World War II, he successfully designed and built one, thus ensuring the Allied victory. Turing became a champion of artificial intelligence, but his work was cut short. As an openly gay man at a time when homosexuality was illegal in England, he was convicted and forced to undergo a humiliating "treatment" that may have led to his suicide. With a novelist's sensitivity, David Leavitt portrays Turing in all his humanity?his eccentricities, his brilliance, his fatal candor?and elegantly explains his work and its implications.

Textbook designed for an introductory undergraduate course in programming using the language Scheme, a small language analogous to a Swiss army knife in its handiness and versatility for small tasks. Annotation copyright Book News, Inc. Portland, Or.

Numerical linear algebra, digital signal processing, and parallel algorithms are three disciplines with a great deal of activity in the last few years. The interaction between them has been growing to a level that merits an Advanced Study Institute dedicated to the three areas together. This volume gives an account of the main results in this interdisciplinary field. The following topics emerged as major themes of the - Singular value and eigenvalue decompositions, including applications, - Toeplitz matrices, including special algorithms and architectures, - Recursive least squares in linear algebra, digital signal processing and control, - Updating and downdating techniques in linear algebra and signal processing, - Stability and sensitivity analysis of special recursive least squares problems, - Special architectures for linear algebra and signal processing. This book contains tutorials on these topics given by leading scientists in each of the three areas. A consider- able number of new research results are presented in contributed papers. The tutorials and papers will be of value to anyone interested in the three disciplines.

This book introduces the basic concepts of parallel and vector computing in the context of an introduction to numerical methods. It contains chapters on parallel and vector matrix multiplication and solution of linear systems by direct and iterative methods. It is suitable for advanced undergraduate and beginning graduate courses in computer science, applied mathematics, and engineering. Ideally, students will have access to a parallel or Vector computer, but the material can be studied profitably in any case.

In this pioneering work, Robert M. Fano presents a comprehensive study of information theory as the basis for communication with computers. The book examines the methods and limits of transmitting and receiving information, with practical applications in digital technology and communication engineering. This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work is in the "public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.

In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. This was a great opportunity for me, as I had known of Professor P61ya since having read his classic book, How to Solve It, as a teenager. Working with P6lya, who ·was over ninety years old at the time, was every bit as rewarding as I had hoped it would be. His creativity, intelligence, warmth and generosity of spirit, and wonderful gift for teaching continue to be an inspiration to me. Combinatorics is one of the branches of mathematics that play a crucial role in computer sCience, since digital computers manipulate discrete, finite objects. Combinatorics impinges on computing in two ways. First, the properties of graphs and other combinatorial objects lead directly to algorithms for solving graph-theoretic problems, which have widespread application in non-numerical as well as in numerical computing. Second, combinatorial methods provide many analytical tools that can be used for determining the worst-case and expected performance of computer algorithms. A knowledge of combinatorics will serve the computer scientist well. Combinatorics can be classified into three enumerative, eXistential, and constructive. Enumerative combinatorics deals with the counting of combinatorial objects. Existential combinatorics studies the existence or nonexistence of combinatorial configurations.

Lecture I The Early History of Fermat's Last Theorem.- 1 The Problem.- 2 Early Attempts.- 3 Kummer's Monumental Theorem.- 4 Regular Primes.- 5 Kummer's Work on Irregular Prime Exponents.- 6 Other Relevant Results.- 7 The Golden Medal and the Wolfskehl Prize.- Lecture II Recent Results.- 1 Stating the Results.- 2 Explanations.- Lecture III B.K. = Before Kummer.- 1 The Pythagorean Equation.- 2 The Biquadratic Equation.- 3 The Cubic Equation.- 4 The Quintic Equation.- 5 Fermat's Equation of Degree Seven.- Lecture IV The Naïve Approach.- 1 The Relations of Barlow and Abel.- 2 Sophie Germain.- 3 Congruences.- 4 Wendt's Theorem.- 5 Abel's Conjecture.- 6 Fermat's Equation with Even Exponent.- 7 Odds and Ends.- Lecture V Kummer's Monument.- 1 A Justification of Kummer's Method.- 2 Basic Facts about the Arithmetic of Cyclotomic Fields.- 3 Kummer's Main Theorem.- Lecture VI Regular Primes.- 1 The Class Number of Cyclotomic Fields.- 2 Bernoulli Numbers and Kummer's Regularity Criterion.- 3 Various Arithmetic Properties of Bernoulli Numbers.- 4 The Abundance of Irregular Primes.- 5 Computation of Irregular Primes.- Lecture VII Kummer Exits.- 1 The Periods of the Cyclotomic Equation.- 2 The Jacobi Cyclotomic Function.- 3 On the Generation of the Class Group of the Cyclotomic Field.- 4 Kummer's Congruences.- 5 Kummer's Theorem for a Class of Irregular Primes.- 6 Computations of the Class Number.- Lecture VIII After Kummer, a New Light.- 1 The Congruences of Mirimanoff.- 2 The Theorem of Krasner.- 3 The Theorems of Wieferich and Mirimanoff.- 4 Fermat's Theorem and the Mersenne Primes.- 5 Summation Criteria.- 6 Fermat Quotient Criteria.- Lecture IX The Power of Class Field Theory.- 1 The Power Residue Symbol.- 2 Kummer Extensions.- 3 The Main Theorems of Furtwängler.- 4 The Method of Singular Integers.- 5 Hasse.- 6 The p-Rank of the Class Group of the Cyclotomic Field.- 7 Criteria of p-Divisibility of the Class Number.- 8 Properly and Improperly Irregular Cyclotomic Fields.- Lecture X Fresh Efforts.- 1 Fermat's Last Theorem Is True for Every Prime Exponent Less Than 125000.- 2 Euler Numbers and Fermat's Theorem.- 3 The First Case Is True for Infinitely Many Pairwise Relatively Prime Exponents.- 4 Connections between Elliptic Curves and Fermat's Theorem.- 5 Iwasawa's Theory.- 6 The Fermat Function Field.- 7 Mordell's Conjecture.- 8 The Logicians.- Lecture XI Estimates.- 1 Elementary (and Not So Elementary) Estimates.- 2 Estimates Based on the Criteria Involving Fermat Quotients.- 3 Thue, Roth, Siegel and Baker.- 4 Applications of the New Methods.- Lecture XII Fermat's Congruence.- 1 Fermat's Theorem over Prime Fields.- 2 The Local Fermat's Theorem.- 3 The Problem Modulo a Prime-Power.- Lecture XIII Variations and Fugue on a Theme.- 1 Variation I (In the Tone of Polynomial Functions).- 2 Variation II (In the Tone of Entire Functions).- 3 Variation III (In the Theta Tone).- 4 Variation IV (In the Tone of Differential Equations).- 5 Variation V (Giocoso).- 6 Variation VI (In the Negative Tone).- 7 Variation VII (In the Ordinal Tone).- 8 Variation VIII (In a Nonassociative Tone).- 9 Variation IX (In the Matrix Tone).- 10 Fugue (In the Quadratic Tone).- Epilogue.- Index of Names.

0 Background.- 1 Fundamental Concepts.- 2 The Degree of a Map.- 3 The Fundamental Group and Covering Spaces.- 4 Manifolds.- 5 Differential Forms and Homology in Euclidean Space.- 6 Homology and Cohomology.- 7 Homotopy Classification of Maps of the Sphere.- 8 Homotopy Groups.- 9 Fibered Spaces.- 10 Fibrations and Homotopy Groups.- 11 Homotopy Theory of Fibrations.- 12 Lie Groups.- 13 Lie Algebras.- 14 Topology of Lie Groups and Homogeneous Manifolds.- 15 Geometry of Gauge Fields.- Index of Notation.

The present book deals with the construction of solutions of linear partial differential equations by means of integral operators which transform analytic functions of a complex variable into such solutions. The theory of analytic functions has achieved a high degree of deve lopment and simplicity, and the operator method permits us to exploit this theory in the study of differential equations. Although the study of existence and uniqueness of solutions has been highly developed, much less attention has been paid to the investigation of function theo retical properties and to the explicit construction of regular and singular solutions using a unified general procedure. This book attempts to fill in the gap in this direction. Integral operators of various types have been used for a long time in the mathematical literature. In this connection one needs only to mention Euler and Laplace. The author has not attempted to give a complete account of all known operators, but rather has aimed at developing a unified approach. For this purpose he uses special operators which preserve various function theoretical properties of analytic functions, such as domains of regularity, validity of series development, connection between the coefficients of these developments and location and character of singularities, etc. However, all efforts were made to give a complete bibliography to help the reader to find more detailed information.

The distributions of linear combinations, and the ratio and products of random variables arise in many applied areas of statistics and probability. This book is essentially a reference text coordinating and unifying the results in this important area and stimulating further applications. Its encyclopedic format makes it useful to teaching faculty, who can set readings and problems from it. Linear Combinations, Ratios, and Products of Distributions with Applications is co-authored by a

* Preface * Introduction * LLL and PSLQ * Pisot and Salem Numbers * Rudin-Shapiro Polynomials * Fekete Polynomials * Products of Cyclotomic Polynomials * Location of Zeros * Maximal Vanishing * Diophantine Approximation of Zeros * The Integer-Chebyshev Problem * The Prouhet-Tarry-Escott Problem * The Easier Waring Problem * The Erdös-Szekeres Problem * Barker Polynomials and Golay Pairs * The Littlewood Problem * Spectra * Appendix A: A Compendium of Inequalities * B: Lattice Basis Reduction and Integer Relations * C: Explicit Merit Factor Formulae * D: Research Problems * References * Index

1 Introduction.- 2 Definitions and First Properties of Computation.- 3 Computation over a Ring.- 4 Decision Problems and Complexity over a Ring.- 5 The Class NP and NP-Complete Problems.- 6 Integer Machines.- 7 Algebraic Settings for the Problem "P ? NP?".- 8 Newton's Method.- 9 Fundamental Theorem of Algebra: Complexity Aspects.- 10 Bézout's Theorem.- 11 Condition Numbers and the Loss of Precision of Linear Equations.- 12 The Condition Number for Nonlinear Problems.- 13 The Condition Number in ?(H(d).- 14 Complexity and the Condition Number.- 15 Linear Programming.- 16 Deterministic Lower Bounds.- 17 Probabilistic Machines.- 18 Parallel Computations.- 19 Some Separations of Complexity Classes.- 20 Weak Machines.- 21 Additive Machines.- 22 Nonuniform Complexity Classes.- 23 Descriptive Complexity.- References.