Author: Blake Crouch
Publisher: Ballantine Books
ISBN: 1524759791
Category : Fiction
Languages : en
Pages : 338
Book Description
NEW YORK TIMES BESTSELLER • From the bestselling author of Dark Matter and the Wayward Pines trilogy comes a relentless thriller about time, identity, and memory—his most mind-boggling, irresistible work to date, and the inspiration for Shondaland’s upcoming Netflix film. “Gloriously twisting . . . a heady campfire tale of a novel.”—The New York Times Book Review NAMED ONE OF THE BEST BOOKS OF THE YEAR BY Time • NPR • BookRiot Reality is broken. At first, it looks like a disease. An epidemic that spreads through no known means, driving its victims mad with memories of a life they never lived. But the force that’s sweeping the world is no pathogen. It’s just the first shock wave, unleashed by a stunning discovery—and what’s in jeopardy is not our minds but the very fabric of time itself. In New York City, Detective Barry Sutton is closing in on the truth—and in a remote laboratory, neuroscientist Helena Smith is unaware that she alone holds the key to this mystery . . . and the tools for fighting back. Together, Barry and Helena will have to confront their enemy—before they, and the world, are trapped in a loop of ever-growing chaos. Praise for Recursion “An action-packed, brilliantly unique ride that had me up late and shirking responsibilities until I had devoured the last page . . . a fantastic read.”—Andy Weir, #1 New York Times bestselling author of The Martian “Another profound science-fiction thriller. Crouch masterfully blends science and intrigue into the experience of what it means to be deeply human.”—Newsweek “Definitely not one to forget when you’re packing for vacation . . . [Crouch] breathes fresh life into matters with a mix of heart, intelligence, and philosophical musings.”—Entertainment Weekly “A trippy journey down memory lane . . . [Crouch’s] intelligence is an able match for the challenge he’s set of overcoming the structure of time itself.”—Time “Wildly entertaining . . . another winning novel from an author at the top of his game.”—AV Club
The Recursive Book of Recursion
Author: Al Sweigart
Publisher: No Starch Press
ISBN: 1718502036
Category : Computers
Languages : en
Pages : 330
Book Description
An accessible yet rigorous crash course on recursive programming using Python and JavaScript examples. Recursion has an intimidating reputation: it’s considered to be an advanced computer science topic frequently brought up in coding interviews. But there’s nothing magical about recursion. The Recursive Book of Recursion uses Python and JavaScript examples to teach the basics of recursion, exposing the ways that it’s often poorly taught and clarifying the fundamental principles of all recursive algorithms. You’ll learn when to use recursive functions (and, most importantly, when not to use them), how to implement the classic recursive algorithms often brought up in job interviews, and how recursive techniques can help solve countless problems involving tree traversal, combinatorics, and other tricky topics. This project-based guide contains complete, runnable programs to help you learn: How recursive functions make use of the call stack, a critical data structure almost never discussed in lessons on recursion How the head-tail and “leap of faith” techniques can simplify writing recursive functions How to use recursion to write custom search scripts for your filesystem, draw fractal art, create mazes, and more How optimization and memoization make recursive algorithms more efficient Al Sweigart has built a career explaining programming concepts in a fun, approachable manner. If you’ve shied away from learning recursion but want to add this technique to your programming toolkit, or if you’re racing to prepare for your next job interview, this book is for you.
Publisher: No Starch Press
ISBN: 1718502036
Category : Computers
Languages : en
Pages : 330
Book Description
An accessible yet rigorous crash course on recursive programming using Python and JavaScript examples. Recursion has an intimidating reputation: it’s considered to be an advanced computer science topic frequently brought up in coding interviews. But there’s nothing magical about recursion. The Recursive Book of Recursion uses Python and JavaScript examples to teach the basics of recursion, exposing the ways that it’s often poorly taught and clarifying the fundamental principles of all recursive algorithms. You’ll learn when to use recursive functions (and, most importantly, when not to use them), how to implement the classic recursive algorithms often brought up in job interviews, and how recursive techniques can help solve countless problems involving tree traversal, combinatorics, and other tricky topics. This project-based guide contains complete, runnable programs to help you learn: How recursive functions make use of the call stack, a critical data structure almost never discussed in lessons on recursion How the head-tail and “leap of faith” techniques can simplify writing recursive functions How to use recursion to write custom search scripts for your filesystem, draw fractal art, create mazes, and more How optimization and memoization make recursive algorithms more efficient Al Sweigart has built a career explaining programming concepts in a fun, approachable manner. If you’ve shied away from learning recursion but want to add this technique to your programming toolkit, or if you’re racing to prepare for your next job interview, this book is for you.
Introduction to Recursive Programming
Author: Manuel Rubio-Sanchez
Publisher: CRC Press
ISBN: 1351647172
Category : Computers
Languages : en
Pages : 400
Book Description
Recursion is one of the most fundamental concepts in computer science and a key programming technique that allows computations to be carried out repeatedly. Despite the importance of recursion for algorithm design, most programming books do not cover the topic in detail, despite the fact that numerous computer programming professors and researchers in the field of computer science education agree that recursion is difficult for novice students. Introduction to Recursive Programming provides a detailed and comprehensive introduction to recursion. This text will serve as a useful guide for anyone who wants to learn how to think and program recursively, by analyzing a wide variety of computational problems of diverse difficulty. It contains specific chapters on the most common types of recursion (linear, tail, and multiple), as well as on algorithm design paradigms in which recursion is prevalent (divide and conquer, and backtracking). Therefore, it can be used in introductory programming courses, and in more advanced classes on algorithm design. The book also covers lower-level topics related to iteration and program execution, and includes a rich chapter on the theoretical analysis of the computational cost of recursive programs, offering readers the possibility to learn some basic mathematics along the way. It also incorporates several elements aimed at helping students master the material. First, it contains a larger collection of simple problems in order to provide a solid foundation of the core concepts, before diving into more complex material. In addition, one of the book's main assets is the use of a step-by-step methodology, together with specially designed diagrams, for guiding and illustrating the process of developing recursive algorithms. Furthermore, the book covers combinatorial problems and mutual recursion. These topics can broaden students' understanding of recursion by forcing them to apply the learned concepts differently, or in a more sophisticated manner. The code examples have been written in Python 3, but should be straightforward to understand for students with experience in other programming languages. Finally, worked out solutions to over 120 end-of-chapter exercises are available for instructors.
Publisher: CRC Press
ISBN: 1351647172
Category : Computers
Languages : en
Pages : 400
Book Description
Recursion is one of the most fundamental concepts in computer science and a key programming technique that allows computations to be carried out repeatedly. Despite the importance of recursion for algorithm design, most programming books do not cover the topic in detail, despite the fact that numerous computer programming professors and researchers in the field of computer science education agree that recursion is difficult for novice students. Introduction to Recursive Programming provides a detailed and comprehensive introduction to recursion. This text will serve as a useful guide for anyone who wants to learn how to think and program recursively, by analyzing a wide variety of computational problems of diverse difficulty. It contains specific chapters on the most common types of recursion (linear, tail, and multiple), as well as on algorithm design paradigms in which recursion is prevalent (divide and conquer, and backtracking). Therefore, it can be used in introductory programming courses, and in more advanced classes on algorithm design. The book also covers lower-level topics related to iteration and program execution, and includes a rich chapter on the theoretical analysis of the computational cost of recursive programs, offering readers the possibility to learn some basic mathematics along the way. It also incorporates several elements aimed at helping students master the material. First, it contains a larger collection of simple problems in order to provide a solid foundation of the core concepts, before diving into more complex material. In addition, one of the book's main assets is the use of a step-by-step methodology, together with specially designed diagrams, for guiding and illustrating the process of developing recursive algorithms. Furthermore, the book covers combinatorial problems and mutual recursion. These topics can broaden students' understanding of recursion by forcing them to apply the learned concepts differently, or in a more sophisticated manner. The code examples have been written in Python 3, but should be straightforward to understand for students with experience in other programming languages. Finally, worked out solutions to over 120 end-of-chapter exercises are available for instructors.
Recursion
Author: Tony Ballantyne
Publisher: Spectra
ISBN: 0553902873
Category : Fiction
Languages : en
Pages : 434
Book Description
The future is everything we wanted it to be—and far more than we bargained for. It is the twenty-third century. Herb, a young entrepreneur, returns to the isolated planet on which he has illegally been trying to build a city—and finds it destroyed by a swarming nightmare of self-replicating machinery. Worse, the all-seeing Environment Agency has been watching him the entire time. His punishment? A nearly hopeless battle in the farthest reaches of the universe against enemy machines twice as fast, and twice as deadly, as his own—in the company of a disarmingly confident AI who may not be exactly what he claims. . . . Little does Herb know that this war of machines was set in motion nearly two hundred years ago—by mankind itself. For it was then that a not-quite-chance encounter brought a confused young girl and a nearly omnipotent AI together in one fateful moment that may have changed the course of humanity forever.
Publisher: Spectra
ISBN: 0553902873
Category : Fiction
Languages : en
Pages : 434
Book Description
The future is everything we wanted it to be—and far more than we bargained for. It is the twenty-third century. Herb, a young entrepreneur, returns to the isolated planet on which he has illegally been trying to build a city—and finds it destroyed by a swarming nightmare of self-replicating machinery. Worse, the all-seeing Environment Agency has been watching him the entire time. His punishment? A nearly hopeless battle in the farthest reaches of the universe against enemy machines twice as fast, and twice as deadly, as his own—in the company of a disarmingly confident AI who may not be exactly what he claims. . . . Little does Herb know that this war of machines was set in motion nearly two hundred years ago—by mankind itself. For it was then that a not-quite-chance encounter brought a confused young girl and a nearly omnipotent AI together in one fateful moment that may have changed the course of humanity forever.
Dark Matter
Author: Blake Crouch
Publisher: Ballantine Books
ISBN: 1101904232
Category : Fiction
Languages : en
Pages : 370
Book Description
NEW YORK TIMES BESTSELLER • COMING SOON TO APPLE TV+ • A “mind-blowing” (Entertainment Weekly) speculative thriller about an ordinary man who awakens in a world inexplicably different from the reality he thought he knew—from the author of Upgrade, Recursion, and the Wayward Pines trilogy “Are you happy with your life?” Those are the last words Jason Dessen hears before the kidnapper knocks him unconscious. Before he awakens to find himself strapped to a gurney, surrounded by strangers in hazmat suits. Before a man he’s never met smiles down at him and says, “Welcome back, my friend.” In this world he’s woken up to, Jason’s life is not the one he knows. His wife is not his wife. His son was never born. And Jason is not an ordinary college professor but a celebrated genius who has achieved something remarkable. Something impossible. Is it this life or the other that’s the dream? And even if the home he remembers is real, how will Jason make it back to the family he loves? From the bestselling author Blake Crouch, Dark Matter is a mind-bending thriller about choices, paths not taken, and how far we’ll go to claim the lives we dream of.
Publisher: Ballantine Books
ISBN: 1101904232
Category : Fiction
Languages : en
Pages : 370
Book Description
NEW YORK TIMES BESTSELLER • COMING SOON TO APPLE TV+ • A “mind-blowing” (Entertainment Weekly) speculative thriller about an ordinary man who awakens in a world inexplicably different from the reality he thought he knew—from the author of Upgrade, Recursion, and the Wayward Pines trilogy “Are you happy with your life?” Those are the last words Jason Dessen hears before the kidnapper knocks him unconscious. Before he awakens to find himself strapped to a gurney, surrounded by strangers in hazmat suits. Before a man he’s never met smiles down at him and says, “Welcome back, my friend.” In this world he’s woken up to, Jason’s life is not the one he knows. His wife is not his wife. His son was never born. And Jason is not an ordinary college professor but a celebrated genius who has achieved something remarkable. Something impossible. Is it this life or the other that’s the dream? And even if the home he remembers is real, how will Jason make it back to the family he loves? From the bestselling author Blake Crouch, Dark Matter is a mind-bending thriller about choices, paths not taken, and how far we’ll go to claim the lives we dream of.
Thinking Recursively
Author: Eric Roberts
Publisher: John Wiley & Sons
ISBN:
Category : Computers
Languages : en
Pages : 200
Book Description
The process of solving large problems by breaking them down intosmaller, more simple problems that have identical forms. ThinkingRecursively: A small text to solve large problems. Concentrating onthe practical value of recursion. this text, the first of its kind,is essential to computer science students' education. In thistext, students will learn the concept and programming applicationsof recursive thinking. This will ultimately prepare students foradvanced topics in computer science such as compiler construction,formal language theory, and the mathematical foundations ofcomputer science. Key Features: * Concentration on the practical value of recursion. * Eleven chapters emphasizing recursion as a unifiedconcept. * Extensive discussion of the mathematical concepts which helpthe students to develop an appropriate conceptual model. * Large number of imaginative examples with solutions. * Large sets of exercises.
Publisher: John Wiley & Sons
ISBN:
Category : Computers
Languages : en
Pages : 200
Book Description
The process of solving large problems by breaking them down intosmaller, more simple problems that have identical forms. ThinkingRecursively: A small text to solve large problems. Concentrating onthe practical value of recursion. this text, the first of its kind,is essential to computer science students' education. In thistext, students will learn the concept and programming applicationsof recursive thinking. This will ultimately prepare students foradvanced topics in computer science such as compiler construction,formal language theory, and the mathematical foundations ofcomputer science. Key Features: * Concentration on the practical value of recursion. * Eleven chapters emphasizing recursion as a unifiedconcept. * Extensive discussion of the mathematical concepts which helpthe students to develop an appropriate conceptual model. * Large number of imaginative examples with solutions. * Large sets of exercises.
The Cybernetic Tea Shop
Author: Meredith Katz
Publisher:
ISBN: 9781989646144
Category : Fiction
Languages : en
Pages : 116
Book Description
Clara Gutierrez is an AI repair technician and a wanderer. Her childhood with her migrant worker family has left her uncomfortable with lingering for too long, so she moves from place to place across retro-futuristic America. Sal is a fully autonomous robot. Older than the law declaring her kind illegal due to ethical concerns, she is at best out of place in society and at worst vilified. She continues to run the tea shop previously owned by her long-dead master, lost in memories of the past, struggling to fulfill her master's dream for the shop while slowly breaking down. They meet by chance, but as they begin to spend time together, they both start to wrestle with the concept of moving on... A F/F retro-future sci-fi asexual romance. A story about artificial intelligence and real kindness, about love, and the feeling of watching steam rising softly from a teacup on a bright and quiet morning.
Publisher:
ISBN: 9781989646144
Category : Fiction
Languages : en
Pages : 116
Book Description
Clara Gutierrez is an AI repair technician and a wanderer. Her childhood with her migrant worker family has left her uncomfortable with lingering for too long, so she moves from place to place across retro-futuristic America. Sal is a fully autonomous robot. Older than the law declaring her kind illegal due to ethical concerns, she is at best out of place in society and at worst vilified. She continues to run the tea shop previously owned by her long-dead master, lost in memories of the past, struggling to fulfill her master's dream for the shop while slowly breaking down. They meet by chance, but as they begin to spend time together, they both start to wrestle with the concept of moving on... A F/F retro-future sci-fi asexual romance. A story about artificial intelligence and real kindness, about love, and the feeling of watching steam rising softly from a teacup on a bright and quiet morning.
Fundamentals of Computer Programming with C#
Author: Svetlin Nakov
Publisher: Faber Publishing
ISBN: 9544007733
Category : Computers
Languages : en
Pages : 1132
Book Description
The free book "Fundamentals of Computer Programming with C#" is a comprehensive computer programming tutorial that teaches programming, logical thinking, data structures and algorithms, problem solving and high quality code with lots of examples in C#. It starts with the first steps in programming and software development like variables, data types, conditional statements, loops and arrays and continues with other basic topics like methods, numeral systems, strings and string processing, exceptions, classes and objects. After the basics this fundamental programming book enters into more advanced programming topics like recursion, data structures (lists, trees, hash-tables and graphs), high-quality code, unit testing and refactoring, object-oriented principles (inheritance, abstraction, encapsulation and polymorphism) and their implementation the C# language. It also covers fundamental topics that each good developer should know like algorithm design, complexity of algorithms and problem solving. The book uses C# language and Visual Studio to illustrate the programming concepts and explains some C# / .NET specific technologies like lambda expressions, extension methods and LINQ. The book is written by a team of developers lead by Svetlin Nakov who has 20+ years practical software development experience. It teaches the major programming concepts and way of thinking needed to become a good software engineer and the C# language in the meantime. It is a great start for anyone who wants to become a skillful software engineer. The books does not teach technologies like databases, mobile and web development, but shows the true way to master the basics of programming regardless of the languages, technologies and tools. It is good for beginners and intermediate developers who want to put a solid base for a successful career in the software engineering industry. The book is accompanied by free video lessons, presentation slides and mind maps, as well as hundreds of exercises and live examples. Download the free C# programming book, videos, presentations and other resources from http://introprogramming.info. Title: Fundamentals of Computer Programming with C# (The Bulgarian C# Programming Book) ISBN: 9789544007737 ISBN-13: 978-954-400-773-7 (9789544007737) ISBN-10: 954-400-773-3 (9544007733) Author: Svetlin Nakov & Co. Pages: 1132 Language: English Published: Sofia, 2013 Publisher: Faber Publishing, Bulgaria Web site: http://www.introprogramming.info License: CC-Attribution-Share-Alike Tags: free, programming, book, computer programming, programming fundamentals, ebook, book programming, C#, CSharp, C# book, tutorial, C# tutorial; programming concepts, programming fundamentals, compiler, Visual Studio, .NET, .NET Framework, data types, variables, expressions, statements, console, conditional statements, control-flow logic, loops, arrays, numeral systems, methods, strings, text processing, StringBuilder, exceptions, exception handling, stack trace, streams, files, text files, linear data structures, list, linked list, stack, queue, tree, balanced tree, graph, depth-first search, DFS, breadth-first search, BFS, dictionaries, hash tables, associative arrays, sets, algorithms, sorting algorithm, searching algorithms, recursion, combinatorial algorithms, algorithm complexity, OOP, object-oriented programming, classes, objects, constructors, fields, properties, static members, abstraction, interfaces, encapsulation, inheritance, virtual methods, polymorphism, cohesion, coupling, enumerations, generics, namespaces, UML, design patterns, extension methods, anonymous types, lambda expressions, LINQ, code quality, high-quality code, high-quality classes, high-quality methods, code formatting, self-documenting code, code refactoring, problem solving, problem solving methodology, 9789544007737, 9544007733
Publisher: Faber Publishing
ISBN: 9544007733
Category : Computers
Languages : en
Pages : 1132
Book Description
The free book "Fundamentals of Computer Programming with C#" is a comprehensive computer programming tutorial that teaches programming, logical thinking, data structures and algorithms, problem solving and high quality code with lots of examples in C#. It starts with the first steps in programming and software development like variables, data types, conditional statements, loops and arrays and continues with other basic topics like methods, numeral systems, strings and string processing, exceptions, classes and objects. After the basics this fundamental programming book enters into more advanced programming topics like recursion, data structures (lists, trees, hash-tables and graphs), high-quality code, unit testing and refactoring, object-oriented principles (inheritance, abstraction, encapsulation and polymorphism) and their implementation the C# language. It also covers fundamental topics that each good developer should know like algorithm design, complexity of algorithms and problem solving. The book uses C# language and Visual Studio to illustrate the programming concepts and explains some C# / .NET specific technologies like lambda expressions, extension methods and LINQ. The book is written by a team of developers lead by Svetlin Nakov who has 20+ years practical software development experience. It teaches the major programming concepts and way of thinking needed to become a good software engineer and the C# language in the meantime. It is a great start for anyone who wants to become a skillful software engineer. The books does not teach technologies like databases, mobile and web development, but shows the true way to master the basics of programming regardless of the languages, technologies and tools. It is good for beginners and intermediate developers who want to put a solid base for a successful career in the software engineering industry. The book is accompanied by free video lessons, presentation slides and mind maps, as well as hundreds of exercises and live examples. Download the free C# programming book, videos, presentations and other resources from http://introprogramming.info. Title: Fundamentals of Computer Programming with C# (The Bulgarian C# Programming Book) ISBN: 9789544007737 ISBN-13: 978-954-400-773-7 (9789544007737) ISBN-10: 954-400-773-3 (9544007733) Author: Svetlin Nakov & Co. Pages: 1132 Language: English Published: Sofia, 2013 Publisher: Faber Publishing, Bulgaria Web site: http://www.introprogramming.info License: CC-Attribution-Share-Alike Tags: free, programming, book, computer programming, programming fundamentals, ebook, book programming, C#, CSharp, C# book, tutorial, C# tutorial; programming concepts, programming fundamentals, compiler, Visual Studio, .NET, .NET Framework, data types, variables, expressions, statements, console, conditional statements, control-flow logic, loops, arrays, numeral systems, methods, strings, text processing, StringBuilder, exceptions, exception handling, stack trace, streams, files, text files, linear data structures, list, linked list, stack, queue, tree, balanced tree, graph, depth-first search, DFS, breadth-first search, BFS, dictionaries, hash tables, associative arrays, sets, algorithms, sorting algorithm, searching algorithms, recursion, combinatorial algorithms, algorithm complexity, OOP, object-oriented programming, classes, objects, constructors, fields, properties, static members, abstraction, interfaces, encapsulation, inheritance, virtual methods, polymorphism, cohesion, coupling, enumerations, generics, namespaces, UML, design patterns, extension methods, anonymous types, lambda expressions, LINQ, code quality, high-quality code, high-quality classes, high-quality methods, code formatting, self-documenting code, code refactoring, problem solving, problem solving methodology, 9789544007737, 9544007733
Recursion Theory
Author: Chi Tat Chong
Publisher: Walter de Gruyter GmbH & Co KG
ISBN: 311038129X
Category : Mathematics
Languages : en
Pages : 409
Book Description
This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory. The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness.
Publisher: Walter de Gruyter GmbH & Co KG
ISBN: 311038129X
Category : Mathematics
Languages : en
Pages : 409
Book Description
This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory. The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness.
The Recursion Method and Its Applications
Author: D.G. Pettifor
Publisher: Springer Science & Business Media
ISBN: 3642824447
Category : Science
Languages : en
Pages : 185
Book Description
This volume reviews recent advances in the development and application of the recursion method in computational solid state physics and elsewhere. It comprises the invited papers which were presented at a two-day conference at Imperial College, London during September 1984. The recursion method is based on the Lanczos algorithm for the tridiago nalisation of matrices, but it is much more than a straightforward numerical technique. It is widely regarded as the most elegant framework for a variety of calculations into which one may incorporate physical insights and a num ber of technical devices. The standard reference is Volume 35 of Solid State Physics, which contains all the early ideas of Heine, Haydock and others, upon which the method was established. The present volume provides the first review of subsequent developments. It also indicates where problems remain, or opinions differ, in the interpretation of the mathematical details or choice of practical techniques in applications. The field is still very li vely and much remains to be done, as the summary chapter clearly demonstra tes. We are grateful to the S. E. R. C. 's Collaborative Computational Project No. 9 on the electronic structure of solids and the Institute of Physics's Solid State Sub-committee for their sponsorship of the conference. We thank Angus MacKinnon for his help in conference organisation and Jacyntha Crawley for secretarial assistance. December 1984 David G. Pettifor Denis L. Weaire v Contents Part I Introduction Why Recur? By V.
Publisher: Springer Science & Business Media
ISBN: 3642824447
Category : Science
Languages : en
Pages : 185
Book Description
This volume reviews recent advances in the development and application of the recursion method in computational solid state physics and elsewhere. It comprises the invited papers which were presented at a two-day conference at Imperial College, London during September 1984. The recursion method is based on the Lanczos algorithm for the tridiago nalisation of matrices, but it is much more than a straightforward numerical technique. It is widely regarded as the most elegant framework for a variety of calculations into which one may incorporate physical insights and a num ber of technical devices. The standard reference is Volume 35 of Solid State Physics, which contains all the early ideas of Heine, Haydock and others, upon which the method was established. The present volume provides the first review of subsequent developments. It also indicates where problems remain, or opinions differ, in the interpretation of the mathematical details or choice of practical techniques in applications. The field is still very li vely and much remains to be done, as the summary chapter clearly demonstra tes. We are grateful to the S. E. R. C. 's Collaborative Computational Project No. 9 on the electronic structure of solids and the Institute of Physics's Solid State Sub-committee for their sponsorship of the conference. We thank Angus MacKinnon for his help in conference organisation and Jacyntha Crawley for secretarial assistance. December 1984 David G. Pettifor Denis L. Weaire v Contents Part I Introduction Why Recur? By V.