‎Mitchell, Melanie‎
‎Complexity‎

‎Science and Complexity. - [CATEGORIZING COMPLEXITY]‎

‎[No printer], 1948. 8vo. In the original printed grey wrappers. Offprint from ""American Scientist, Autunmn Issue, 1948, Vol. 36, No. 4"". A very fine and clean copy, near mint. 536-544 pp.‎

‎Rare offprint issue of Weaver's famous essay on complexity ""in which he rather boldly claimed that while ""the 19th century was the century of disorganized complexity - the 20th century must be that of organized complexity"". Weaver is widely recognized as one of the pioneers of machine translation, and as an important figure in creating support for science in the United States. Weaver stated that that the complexity of a particular system is the degree of difficulty in predicting the properties of the system, if the properties of the system's parts are given and he divides complexity between disorganized complexity, and organized complexity. This categorization has deeply influenced contemporary thinking about complexity.""For historical setting, this article was published shortly after World War II and is influenced by operations research and the first computers developed for for the war effort. During the war, Weaver headed the Applied Mathematics Panel (AAAS, 2004), a position that led to familiarity with many of the top scientists of the era. It was a time of great advances in science and optimism for more growth in the future. This article was also written at the time Weaver was formulating ideas that would later be published with Claude Shannon in The mathematical theory of communication, which laid the foundation for information theory. Weaver's thoughts during this time on how computers might be employed in machine translation were later collected in his famous memorandum on the topic that ""formulated goals and methods before most people had any idea of what computers might be capable of"". (Griffin, Information theory of Claude Shannon & Warren Weaver).‎

‎Analytic Computational Complexity , Proceedings of the Symposium on Analytic Computational Complexity held by the Computer Science Department, Carnegie-Mellon University, Pittsburg, on April, 7-8 1975‎

‎Academic Press Malicorne sur Sarthe, 72, Pays de la Loire, France 1976 Book condition, Etat : Bon hardcover, no dust-jacket grand In-8 1 vol. - 248 pages‎

‎ 1st Edition Contents, Chapitres : Contents, Preface, ix, Text, 239 pages - J.F. Traub : Introduction - S. Winograd : Some remarks on proof techniques in analytic complexity - J.F. Traub and H. Wozniakowski : Strict lower and upper bounds on iterative computational complexity - H.T. Kung : The complex of obtaining starting points for solving operator equations by Newton's method - Richard P. Brent : A class of optimal-order zero-finding methods using derivative evaluations - H. Wozniakowski : Maximal order of mulipoint iterations using n evaluations - Robert Meersman : Optimal use of information in certain iterative processes - B. Kacewicz : The use of integrals in the solution of nonlinear equations in N dimensions - M.H. Schulz : Complexity and differential equations - Richard P. Brent : Multiple-decision zero-finding methods and the complexity of elementary function evaluation - H. Wozniakowski : Numerical stability of iterations for solution of nonlinear equations and large linear systems - John R. Rice : On the computational complexity of approximation operators II - David Y.Y. Yun : Hensel meets Newton - algebraic construction in an analytic setting - Richard P. Brent and H.T. Kung : O ((n log n) 3/2) algorithms for composition and reversion of power series - Abstracts of contributed papers ex-library copy, sticker on the spine and few stamps on the first pages, else very good copy, no other markings, the spine is very lightly torn‎

‎Cities and Complexity : Understanding Cities with Cellular Automata, Agent-Based Models, and Fractals‎

‎Cambridge, Mass., United States, MIT Press Ltd 2007, 2007 Paperback, 565 pages, ENG, 230 x 205 mm, in very good condition, with over 180 images/ illustrations in b/w. ISBN 9780262524797.‎

‎Mario Carpo provides a subtle and insightful discussion of the intellectual structures that guide architectural composition and the ways that these structures were transformed by the historic shifts from script to print and from hand-made drawings to mechanically reproduced images. He goes on to suggest that the current shift from print to digital representations will have similarly profound consequences. This is a crucial text for anyone interested in the interrelationships of media and design processes. As urban planning moves from a centralized, top-down approach to a decentralized, bottom-up perspective, our conception of urban systems is changing. In Cities and Complexity, Michael Batty offers a comprehensive view of urban dynamics in the context of complexity theory, presenting models that demonstrate how complexity theory can embrace a myriad of processes and elements that combine into organic wholes. He argues that bottom-up processes--in which the outcomes are always uncertain--can combine with new forms of geometry associated with fractal patterns and chaotic dynamics to provide theories that are applicable to highly complex systems such as cities. Batty begins with models based on cellular automata (CA), simulating urban dynamics through the local actions of automata. He then introduces agent-based models (ABM), in which agents are mobile and move between locations. These models relate to many scales, from the scale of the street to patterns and structure at the scale of the urban region. Finally, Batty develops applications of all these models to specific urban situations, discussing concepts of criticality, threshold, surprise, novelty, and phase transition in the context of spatial developments. Every theory and model presented in the book is developed through examples that range from the simplified and hypothetical to the actual. Deploying extensive visual, mathematical, and textual material, Cities and Complexity will be read both by urban researchers and by complexity theorists with an interest in new kinds of computational models.‎

‎Papadimitriou Steiglitz. Combinatorial Optimization Algorithms and Complexity. C‎

‎Papadimitriou Steiglitz. Combinatorial Optimization Algorithms and Complexity. Combination Optimization. Algorithms and Complexity. In Russian (ask us if in doubt)/Papadimitriou Steiglitz. Combinatorial Optimization Algorithms and Complexity. Kombinatornaya optimizatsiya. Algoritmy i slozhnost. Dover 528 c. We have thousands of titles and often several copies of each title may be available. Please feel free to contact us for a detailed description of the copies available. SKUalbdfa669eca9620f51‎

‎Ilya Prigozhin. From the existing to the emerging. Time and complexity in the ph‎

‎Ilya Prigozhin. From the existing to the emerging. Time and complexity in the physical sciences. In Russian (ask us if in doubt)/Prigozhin Ilya. Ot sushchestvuyushchego k voznikayushchemu. Vremya i slozhnost v fizicheskikh naukakh.. Short description: In Russian (ask us if in doubt).Translation from English by Yu. A. Danilov. Edited by Yu. L. Klimontovich. Foreword and afterword by Yu. L. Klimontovich. Edited by L. P. Rusakova. Moscow. Science. 1985. 328 p. We have thousands of titles and often several copies of each title may be available. Please feel free to contact us for a detailed description of the copies available. SKUalbbd540dfd39783560‎