Download or read book The Nature of Computation Logic Algorithms Applications written by Paola Bonizzoni and published by Springer. This book was released on 2013-06-03 with total page 462 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 9th Conference on Computability in Europe, CiE 2013, held in Milan, Italy, in July 2013. The 48 revised papers presented together with 1 invited lecture and 2 tutorials were carefully reviewed and selected with an acceptance rate of under 31,7%. Both the conference series and the association promote the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences such as physics and biology, and also including the promotion of related non-scientific fields such as philosophy and history of computing.
Download or read book The Nature of Computation written by Cristopher Moore and published by OUP Oxford. This book was released on 2011-08-11 with total page 1498 pages. Available in PDF, EPUB and Kindle. Book excerpt: Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to biology. But this beauty is often buried underneath layers of unnecessary formalism, and exciting recent results like interactive proofs, phase transitions, and quantum computing are usually considered too advanced for the typical student. This book bridges these gaps by explaining the deep ideas of theoretical computer science in a clear and enjoyable fashion, making them accessible to non-computer scientists and to computer scientists who finally want to appreciate their field from a new point of view. The authors start with a lucid and playful explanation of the P vs. NP problem, explaining why it is so fundamental, and so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing. At every turn, they use a minimum of formalism, providing explanations that are both deep and accessible. The book is intended for graduate and undergraduate students, scientists from other areas who have long wanted to understand this subject, and experts who want to fall in love with this field all over again.
Download or read book On the Foundations of Computing written by Giuseppe Primiero and published by Oxford University Press. This book was released on 2019-11-19 with total page 448 pages. Available in PDF, EPUB and Kindle. Book excerpt: Computing, today more than ever before, is a multi-faceted discipline which collates several methodologies, areas of interest, and approaches: mathematics, engineering, programming, and applications. Given its enormous impact on everyday life, it is essential that its debated origins are understood, and that its different foundations are explained. On the Foundations of Computing offers a comprehensive and critical overview of the birth and evolution of computing, and it presents some of the most important technical results and philosophical problems of the discipline, combining both historical and systematic analyses. The debates this text surveys are among the latest and most urgent ones: the crisis of foundations in mathematics and the birth of the decision problem, the nature of algorithms, the debates on computational artefacts and malfunctioning, and the analysis of computational experiments. By covering these topics, On the Foundations of Computing provides a much-needed resource to contextualize these foundational issues. For practitioners, researchers, and students alike, a historical and philosophical approach such as what this volume offers becomes essential to understand the past of the discipline and to figure out the challenges of its future.
Download or read book Distributed Computing and Artificial Intelligence Special Sessions 17th International Conference written by Sara Rodríguez González and published by Springer Nature. This book was released on 2020-07-28 with total page 269 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book brings together past insights, current research and promising future trends associated with distributed computing, artificial intelligence and their application in order to provide efficient solutions to real-world problems. The book is based on the International Conference on Distributed Computing and Artificial Intelligence 2020 (DCAI 2020), which provided a forum to present applications of innovative techniques for studying and solving complex problems in artificial intelligence and computing areas. It includes contributions on well-established and evolving areas of research, by authors from 26 countries, representing a truly “wide area network” of research activity
Download or read book The Handbook of Rationality written by Markus Knauff and published by MIT Press. This book was released on 2021-12-14 with total page 879 pages. Available in PDF, EPUB and Kindle. Book excerpt: The first reference on rationality that integrates accounts from psychology and philosophy, covering descriptive and normative theories from both disciplines. Both analytic philosophy and cognitive psychology have made dramatic advances in understanding rationality, but there has been little interaction between the disciplines. This volume offers the first integrated overview of the state of the art in the psychology and philosophy of rationality. Written by leading experts from both disciplines, The Handbook of Rationality covers the main normative and descriptive theories of rationality—how people ought to think, how they actually think, and why we often deviate from what we can call rational. It also offers insights from other fields such as artificial intelligence, economics, the social sciences, and cognitive neuroscience. The Handbook proposes a novel classification system for researchers in human rationality, and it creates new connections between rationality research in philosophy, psychology, and other disciplines. Following the basic distinction between theoretical and practical rationality, the book first considers the theoretical side, including normative and descriptive theories of logical, probabilistic, causal, and defeasible reasoning. It then turns to the practical side, discussing topics such as decision making, bounded rationality, game theory, deontic and legal reasoning, and the relation between rationality and morality. Finally, it covers topics that arise in both theoretical and practical rationality, including visual and spatial thinking, scientific rationality, how children learn to reason rationally, and the connection between intelligence and rationality.
Download or read book Ordinal Computability written by Merlin Carl and published by Walter de Gruyter GmbH & Co KG. This book was released on 2019-09-23 with total page 343 pages. Available in PDF, EPUB and Kindle. Book excerpt: Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to transfinite working time and space. In particular, recognizability, randomness, and applications to other areas of mathematics are covered.
Download or read book A Companion to the History of Science written by Bernard Lightman and published by John Wiley & Sons. This book was released on 2016-01-28 with total page 596 pages. Available in PDF, EPUB and Kindle. Book excerpt: The Wiley Blackwell Companion to the History of Science is a single volume companion that discusses the history of science as it is done today, providing a survey of the debates and issues that dominate current scholarly discussion, with contributions from leading international scholars. Provides a single-volume overview of current scholarship in the history of science edited by one of the leading figures in the field Features forty essays by leading international scholars providing an overview of the key debates and developments in the history of science Reflects the shift towards deeper historical contextualization within the field Helps communicate and integrate perspectives from the history of science with other areas of historical inquiry Includes discussion of non-Western themes which are integrated throughout the chapters Divided into four sections based on key analytic categories that reflect new approaches in the field
Download or read book The Calculus of Computation written by Aaron R. Bradley and published by Springer Science & Business Media. This book was released on 2007-09-18 with total page 375 pages. Available in PDF, EPUB and Kindle. Book excerpt: Written with graduate and advanced undergraduate students in mind, this textbook introduces computational logic from the foundations of first-order logic to state-of-the-art decision procedures for arithmetic, data structures, and combination theories. The textbook also presents a logical approach to engineering correct software. Verification exercises are given to develop the reader's facility in specifying and verifying software using logic. The treatment of verification concludes with an introduction to the static analysis of software, an important component of modern verification systems. The final chapter outlines courses of further study.
Download or read book Milestones in Analog and Digital Computing written by Herbert Bruderer and published by Springer Nature. This book was released on 2021-01-04 with total page 2072 pages. Available in PDF, EPUB and Kindle. Book excerpt: This Third Edition is the first English-language edition of the award-winning Meilensteine der Rechentechnik; illustrated in full color throughout in two volumes. The Third Edition is devoted to both analog and digital computing devices, as well as the world's most magnificient historical automatons and select scientific instruments (employed in astronomy, surveying, time measurement, etc.). It also features detailed instructions for analog and digital mechanical calculating machines and instruments, and is the only such historical book with comprehensive technical glossaries of terms not found in print or in online dictionaries. The book also includes a very extensive bibliography based on the literature of numerous countries around the world. Meticulously researched, the author conducted a worldwide survey of science, technology and art museums with their main holdings of analog and digital calculating and computing machines and devices, historical automatons and selected scientific instruments in order to describe a broad range of masterful technical achievements. Also covering the history of mathematics and computer science, this work documents the cultural heritage of technology as well.
Download or read book Probabilistic Cellular Automata written by Pierre-Yves Louis and published by Springer. This book was released on 2018-02-21 with total page 344 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book explores Probabilistic Cellular Automata (PCA) from the perspectives of statistical mechanics, probability theory, computational biology and computer science. PCA are extensions of the well-known Cellular Automata models of complex systems, characterized by random updating rules. Thanks to their probabilistic component, PCA offer flexible computing tools for complex numerical constructions, and realistic simulation tools for phenomena driven by interactions among a large number of neighboring structures. PCA are currently being used in various fields, ranging from pure probability to the social sciences and including a wealth of scientific and technological applications. This situation has produced a highly diversified pool of theoreticians, developers and practitioners whose interaction is highly desirable but can be hampered by differences in jargon and focus. This book – just as the workshop on which it is based – is an attempt to overcome these difference and foster interest among newcomers and interaction between practitioners from different fields. It is not intended as a treatise, but rather as a gentle introduction to the role and relevance of PCA technology, illustrated with a number of applications in probability, statistical mechanics, computer science, the natural sciences and dynamical systems. As such, it will be of interest to students and non-specialists looking to enter the field and to explore its challenges and open issues.
Download or read book The Science of Computing written by Matti Tedre and published by CRC Press. This book was released on 2014-12-03 with total page 290 pages. Available in PDF, EPUB and Kindle. Book excerpt: The identity of computing has been fiercely debated throughout its short history. Why is it still so hard to define computing as an academic discipline? Is computing a scientific, mathematical, or engineering discipline? By describing the mathematical, engineering, and scientific traditions of computing, The Science of Computing: Shaping a Discipli
Download or read book Turing s Revolution written by Giovanni Sommaruga and published by Birkhäuser. This book was released on 2016-01-21 with total page 329 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book provides an overview of the confluence of ideas in Turing’s era and work and examines the impact of his work on mathematical logic and theoretical computer science. It combines contributions by well-known scientists on the history and philosophy of computability theory as well as on generalised Turing computability. By looking at the roots and at the philosophical and technical influence of Turing’s work, it is possible to gather new perspectives and new research topics which might be considered as a continuation of Turing’s working ideas well into the 21st century.
Download or read book Developments in Language Theory written by Mizuho Hoshi and published by Springer. This book was released on 2018-09-03 with total page 568 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the proceedings of the 22nd International Conference on Developments in Language Theory, DLT 2018, held in Tokyo, Japan, in September 2018. The 39 full papers presented in this volume were carefully reviewed and selected from 84 submissions. The papers cover the following topics and areas: combinatorial and algebraic properties of words and languages; grammars, acceptors and transducers for strings, trees, graphics, arrays; algebraic theories for automata and languages; codes; efficient text algorithms; symbolic dynamics; decision problems; relationships to complexity theory and logic; picture description and analysis, polyominoes and bidimensional patterns; cryptography; concurrency; celluar automata; bio-inspired computing; quantum computing.
Download or read book Fine grained complexity analysis of some combinatorial data science problems written by Froese, Vincent and published by Universitätsverlag der TU Berlin. This book was released on 2018-10-10 with total page 185 pages. Available in PDF, EPUB and Kindle. Book excerpt: This thesis is concerned with analyzing the computational complexity of NP-hard problems related to data science. For most of the problems considered in this thesis, the computational complexity has not been intensively studied before. We focus on the complexity of computing exact problem solutions and conduct a detailed analysis identifying tractable special cases. To this end, we adopt a parameterized viewpoint in which we spot several parameters which describe properties of a specific problem instance that allow to solve the instance efficiently. We develop specialized algorithms whose running times are polynomial if the corresponding parameter value is constant. We also investigate in which cases the problems remain intractable even for small parameter values. We thereby chart the border between tractability and intractability for some practically motivated problems which yields a better understanding of their computational complexity. In particular, we consider the following problems. General Position Subset Selection is the problem to select a maximum number of points in general position from a given set of points in the plane. Point sets in general position are well-studied in geometry and play a role in data visualization. We prove several computational hardness results and show how polynomial-time data reduction can be applied to solve the problem if the sought number of points in general position is very small or very large. The Distinct Vectors problem asks to select a minimum number of columns in a given matrix such that all rows in the selected submatrix are pairwise distinct. This problem is motivated by combinatorial feature selection. We prove a complexity dichotomy with respect to combinations of the minimum and the maximum pairwise Hamming distance of the rows for binary input matrices, thus separating polynomial-time solvable from NP-hard cases. Co-Clustering is a well-known matrix clustering problem in data mining where the goal is to partition a matrix into homogenous submatrices. We conduct an extensive multivariate complexity analysis revealing several NP-hard and some polynomial-time solvable and fixed-parameter tractable cases. The generic F-free Editing problem is a graph modification problem in which a given graph has to be modified by a minimum number of edge modifications such that it does not contain any induced subgraph isomorphic to the graph F. We consider three special cases of this problem: The graph clustering problem Cluster Editing with applications in machine learning, the Triangle Deletion problem which is motivated by network cluster analysis, and Feedback Arc Set in Tournaments with applications in rank aggregation. We introduce a new parameterization by the number of edge modifications above a lower bound derived from a packing of induced forbidden subgraphs and show fixed-parameter tractability for all of the three above problems with respect to this parameter. Moreover, we prove several NP-hardness results for other variants of F-free Editing for a constant parameter value. The problem DTW-Mean is to compute a mean time series of a given sample of time series with respect to the dynamic time warping distance. This is a fundamental problem in time series analysis the complexity of which is unknown. We give an exact exponential-time algorithm for DTW-Mean and prove polynomial-time solvability for the special case of binary time series. Diese Dissertation befasst sich mit der Analyse der Berechnungskomplexität von NP-schweren Problemen aus dem Bereich Data Science. Für die meisten der hier betrachteten Probleme wurde die Berechnungskomplexität bisher nicht sehr detailliert untersucht. Wir führen daher eine genaue Komplexitätsanalyse dieser Probleme durch, mit dem Ziel, effizient lösbare Spezialfälle zu identifizieren. Zu diesem Zweck nehmen wir eine parametrisierte Perspektive ein, bei der wir bestimmte Parameter definieren, welche Eigenschaften einer konkreten Probleminstanz beschreiben, die es ermöglichen, diese Instanz effizient zu lösen. Wir entwickeln dabei spezielle Algorithmen, deren Laufzeit für konstante Parameterwerte polynomiell ist. Darüber hinaus untersuchen wir, in welchen Fällen die Probleme selbst bei kleinen Parameterwerten berechnungsschwer bleiben. Somit skizzieren wir die Grenze zwischen schweren und handhabbaren Probleminstanzen, um ein besseres Verständnis der Berechnungskomplexität für die folgenden praktisch motivierten Probleme zu erlangen. Beim General Position Subset Selection Problem ist eine Menge von Punkten in der Ebene gegeben und das Ziel ist es, möglichst viele Punkte in allgemeiner Lage davon auszuwählen. Punktmengen in allgemeiner Lage sind in der Geometrie gut untersucht und spielen unter anderem im Bereich der Datenvisualisierung eine Rolle. Wir beweisen etliche Härteergebnisse und zeigen, wie das Problem mittels Polynomzeitdatenreduktion gelöst werden kann, falls die Anzahl gesuchter Punkte in allgemeiner Lage sehr klein oder sehr groß ist. Distinct Vectors ist das Problem, möglichst wenige Spalten einer gegebenen Matrix so auszuwählen, dass in der verbleibenden Submatrix alle Zeilen paarweise verschieden sind. Dieses Problem hat Anwendungen im Bereich der kombinatorischen Merkmalsselektion. Wir betrachten Kombinationen aus maximalem und minimalem paarweisen Hamming-Abstand der Zeilenvektoren und beweisen eine Komplexitätsdichotomie für Binärmatrizen, welche die NP-schweren von den polynomzeitlösbaren Kombinationen unterscheidet. Co-Clustering ist ein bekanntes Matrix-Clustering-Problem aus dem Gebiet Data-Mining. Ziel ist es, eine Matrix in möglichst homogene Submatrizen zu partitionieren. Wir führen eine umfangreiche multivariate Komplexitätsanalyse durch, in der wir zahlreiche NP-schwere, sowie polynomzeitlösbare und festparameterhandhabbare Spezialfälle identifizieren. Bei F-free Editing handelt es sich um ein generisches Graphmodifikationsproblem, bei dem ein Graph durch möglichst wenige Kantenmodifikationen so abgeändert werden soll, dass er keinen induzierten Teilgraphen mehr enthält, der isomorph zum Graphen F ist. Wir betrachten die drei folgenden Spezialfälle dieses Problems: Das Graph-Clustering-Problem Cluster Editing aus dem Bereich des Maschinellen Lernens, das Triangle Deletion Problem aus der Netzwerk-Cluster-Analyse und das Problem Feedback Arc Set in Tournaments mit Anwendungen bei der Aggregation von Rankings. Wir betrachten eine neue Parametrisierung mittels der Differenz zwischen der maximalen Anzahl Kantenmodifikationen und einer unteren Schranke, welche durch eine Menge von induzierten Teilgraphen bestimmt ist. Wir zeigen Festparameterhandhabbarkeit der drei obigen Probleme bezüglich dieses Parameters. Darüber hinaus beweisen wir etliche NP-Schwereergebnisse für andere Problemvarianten von F-free Editing bei konstantem Parameterwert. DTW-Mean ist das Problem, eine Durchschnittszeitreihe bezüglich der Dynamic-Time-Warping-Distanz für eine Menge gegebener Zeitreihen zu berechnen. Hierbei handelt es sich um ein grundlegendes Problem der Zeitreihenanalyse, dessen Komplexität bisher unbekannt ist. Wir entwickeln einen exakten Exponentialzeitalgorithmus für DTW-Mean und zeigen, dass der Spezialfall binärer Zeitreihen in polynomieller Zeit lösbar ist.
Download or read book Logic and Theory of Algorithms written by Arnold Beckmann and published by Springer. This book was released on 2008-06-11 with total page 613 pages. Available in PDF, EPUB and Kindle. Book excerpt: CiE 2008: Logic and Theory of Algorithms Athens, Greece, June 15–20, 2008 Computability in Europe (CiE) is an informal network of European scientists working on computability theory, including its foundations, technical devel- ment, and applications. Among the aims of the network is to advance our t- oretical understanding of what can and cannot be computed, by any means of computation. Its scienti?c vision is broad: computations may be performed with discrete or continuous data by all kinds of algorithms, programs, and - chines. Computations may be made by experimenting with any sort of physical system obeying the laws of a physical theory such as Newtonian mechanics, quantum theory, or relativity. Computations may be very general, depending on the foundations of set theory; or very speci?c, using the combinatorics of ?nite structures. CiE also works on subjects intimately related to computation, especially theories of data and information, and methods for formal reasoning about computations. The sources of new ideas and methods include practical developments in areas such as neural networks, quantum computation, natural computation, molecular computation, computational learning. Applications are everywhere,especially, in algebra,analysisand geometry, or data types and p- gramming. Within CiE there is general recognition of the underlying relevance of computability to physics and a broad range of other sciences, providing as it does a basic analysis of the causal structure of dynamical systems. Thisvolume,Logic andTheory of Algorithms,istheproceedingsofthefourth in a series of conferences of CiE that was held at the University of Athens, June 15–20, 2008.
Download or read book Mathematics and Computation written by Avi Wigderson and published by Princeton University Press. This book was released on 2019-10-29 with total page 434 pages. Available in PDF, EPUB and Kindle. Book excerpt: An introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography
Download or read book From Russia with Code written by Mario Biagioli and published by Duke University Press. This book was released on 2019-03-14 with total page 394 pages. Available in PDF, EPUB and Kindle. Book excerpt: While Russian computer scientists are notorious for their interference in the 2016 US presidential election, they are ubiquitous on Wall Street and coveted by international IT firms and often perceive themselves as the present manifestation of the past glory of Soviet scientific prowess. Drawing on over three hundred in-depth interviews, the contributors to From Russia with Code trace the practices, education, careers, networks, migrations, and lives of Russian IT professionals at home and abroad, showing how they function as key figures in the tense political and ideological environment of technological innovation in post-Soviet Russia. Among other topics, they analyze coders' creation of both transnational communities and local networks of political activists; Moscow's use of IT funding to control peripheral regions; brain drain and the experiences of coders living abroad in the United Kingdom, United States, Israel, and Finland; and the possible meanings of Russian computing systems in a heterogeneous nation and industry. Highlighting the centrality of computer scientists to post-Soviet economic mobilization in Russia, the contributors offer new insights into the difficulties through which a new entrepreneurial culture emerges in a rapidly changing world. Contributors. Irina Antoschyuk, Mario Biagioli, Ksenia Ermoshina, Marina Fedorova, Andrey Indukaev, Alina Kontareva, Diana Kurkovsky, Vincent Lépinay, Alexandra Masalskaya, Daria Savchenko, Liubava Shatokhina, Alexandra Simonova, Ksenia Tatarchenko, Zinaida Vasilyeva, Dimitrii Zhikharevich
