Muutke küpsiste eelistusi

E-raamat: Incomputable: Journeys Beyond the Turing Barrier

Edited by , Edited by
  • Formaat - EPUB+DRM
  • Hind: 135,23 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book questions the relevance of computation to the physical universe. Our theories deliver computational descriptions, but the gaps and discontinuities in our grasp suggest a need for continued discourse between researchers from different disciplines, and this book is unique in its focus on the mathematical theory of incomputability and its relevance for the real world. The book consists of thirteen chapters contained in five parts on extended models of computation; the search for natural examples of incomputable objects; mind, matter, and computation; the nature of information, complexity, and randomness; and the mathematics of emergence and morphogenesis.This book will be of interest to researchers in the area of theoretical computer science, mathematical logic, and philosophy.

Part I, Challenging Turing: Extended Models of Computation.- Ivan Soskov: A Life in Computability.- Physical Logic.- From Quantum Foundations via Natural Language Meaning to a Theory of Everything.- Part II, The Search for "Natural" Examples of Incomputable Objects.- Some Recent Research Directions in the Computably Enumerable Sets.- Uncomputability and Physical Law.- Algorithmic Economics: Incomputability, Undecidability and Unsolv ability in Economics.- Part III, Mind, Matter and Computation.- Is Quantum Physics Relevant for Life .- Trouble with Computation: A Refutation of Digital Ontology.- Part IV, The Nature of Information: Complexity and Randomness.- Complexity Barriers as Independence.- Quantum Randomness: From Practice to Theory and Back.- Calculus of Cost Functions.- Part V -- The Mathematics of Emergence and Morphogenesis.- Turing"s Theory of Morphogenesis: Where We Started, Where We Are and Where We Want to Go.- Construction Kits for Biological Evolution.

Arvustused

The incomputable explores selected recent research into various aspects of computability. This includes abstract models of computation, how quantum algorithms could in some sense redefine aspects of computability, and how the notion of computability relates to the physical world and physical processes. The book leads with a tribute to the late Ivan Soskov, a Bulgarian computer scientist who dedicated his professional career to studying computability theories, particularly computability over abstract structures. (G. R. Mayforth,Computing Reviews, March, 2018)

Introduction 1(10)
Mariya I. Soskova
Part I Challenging Turing: Extended Models of Computation
Ivan Soskov: A Life in Computability
11(36)
Hristo Ganchev
Dimiter Skordev
Physical Logic
47(16)
Kate Clements
Fay Dowker
Petros Wallden
From Quantum Foundations via Natural Language Meaning to a Theory of Everything
63(20)
Bob Coecke
Part II The Search for "Natural" Examples of Incomputable Objects
Some Recent Research Directions in the Computably Enumerable Sets
83(12)
Peter A. Cholak
Uncomputability and Physical Law
95(10)
Seth Lloyd
Algorithmic Economics: Incomputability, Undecidability and Unsolvability in Economics
105(18)
K. Vela Velupillai
Part III Mind, Matter and Computation
Is Quantum Physics Relevant for Life?
123(10)
Vlatko Vedral
Trouble with Computation: A Refutation of Digital Ontology
133(10)
J. Mark Bishop
Part IV The Nature of Information: Complexity and Randomness
Complexity Barriers as Independence
143(26)
Antonina Kolokolova
Quantum Randomness: From Practice to Theory and Back
169(14)
Cristian S. Calude
Calculus of Cost Functions
183(36)
Andre Nies
Part V The Mathematics of Emergence and Morphogenesis
Turing's Theory of Morphogenesis: Where We Started, Where We Are and Where We Want to Go
219(18)
Thomas E. Woolley
Ruth E. Baker
Philip K. Maini
Construction Kits for Biological Evolution 237
Aaron Sloman
Prof. S. Barry Cooper was a Professor of Pure Mathematics at the University of Leeds. He was the founding President of the Computability in Europe Association, and a prolific author and editor in the domain of computability. He championed Alan Turing's achievements in logic and computer science, and in particular he motivated and organized cross-disciplinary collaborations, among them the events, publications and broadcasts of the Alan Turing Year in 2012.

Dr. Mariya I. Soskova is an associate professor in the Dept. of Mathematical Logic and Applications in Sofia University. She was recently a visiting scholar at the University of California, and a visiting seminar professor at the Dept. of Mathematics at the University of Wisconsin, Madison.