Super Recursive Algorithms

Author: Mark Burgin
Publisher: Springer Science & Business Media
ISBN: 0387268065
Format: PDF, Docs
Download Now
* The first exposition on super-recursive algorithms, systematizing all main classes and providing an accessible, focused examination of the theory and its ramifications * Demonstrates how these algorithms are more appropriate as mathematical models for modern computers and how they present a better framework for computing methods * Develops a new practically-oriented perspective on the theory of algorithms, computation, and automata, as a whole

Worldviews Science and Us

Author: Carlos Gershenson
Publisher: World Scientific
ISBN: 9812705481
Format: PDF, ePub, Docs
Download Now
Nell'introduzione si legge: Many chapters in this volume are derived from presentations given at the Philosophy and Complexity session of the Complexity, Science and Society Conference, held in Liverpool, UK, between September 11th and 14th 2005.

Thinking Machines and the Philosophy of Computer Science

Author: Jordi Vallverdú
Publisher: IGI Global Snippet
ISBN: 1616920157
Format: PDF, ePub
Download Now
This discipline of philosophy and computer science offers an interdisciplinary exchange of ideas that range from philosophical and mathematical logic to epistemology, engineering, ethics or neuroscience. Thinking Machines and the Philosophy of Computer Science: Concepts and Principles presents a conversation between established experts and new researchers in the field of philosophy and computer science about human and non-human relationships with the environment. This resource contains five sections including topics on philosophical analysis, the posterior ethical debate, the nature of computer simulations, and the crossroads between robotics, AI, cognitive theories and philosophy.

Hypercomputation

Author: Apostolos Syropoulos
Publisher: Springer Science & Business Media
ISBN: 9780387499703
Format: PDF, Kindle
Download Now
This book provides a thorough description of hypercomputation. It covers all attempts at devising conceptual hypermachines and all new promising computational paradigms that may eventually lead to the construction of a hypermachine. Readers will gain a deeper understanding of what computability is, and why the Church-Turing thesis poses an arbitrary limit to what can be actually computed. Hypercomputing is a relatively novel idea. However, the book’s most important features are its description of the various attempts of hypercomputation, from trial-and-error machines to the exploration of the human mind, if we treat it as a computing device.

Artificial intelligence and computer science

Author: Susan Shannon
Publisher: Nova Science Pub Inc
ISBN:
Format: PDF, Kindle
Download Now
This book presents leading-edge research in the field of computer research, technology and applications. Each contribution has been carefully selected for inclusion based on the significance of the research to the field. Summaries of all chapters are gathered at the beginning of the book and an in-depth index is presented to facilitate access.

Algorithms in Combinatorial Geometry

Author: Herbert Edelsbrunner
Publisher: Springer Science & Business Media
ISBN: 3642615686
Format: PDF
Download Now
Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.