![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
The Incomputable 2017
- S. Barry Cooper, Mariya Ivanova Soskova:
The Incomputable: Journeys Beyond the Turing Barrier. Theory and Applications of Computability, Springer International Publishing 2017, ISBN 978-3-319-43667-8 - Mariya Ivanova Soskova:
Introduction. 1-8 - Hristo Ganchev, Dimiter Skordev:
Ivan Soskov: A Life in Computability. 11-46 - Kate Clements, Fay Dowker, Petros Wallden
:
Physical Logic. 47-61 - Bob Coecke:
From Quantum Foundations via Natural Language Meaning to a Theory of Everything. 63-80 - Peter A. Cholak:
Some Recent Research Directions in the Computably Enumerable Sets. 83-93 - Seth Lloyd:
Uncomputability and Physical Law. 95-104 - K. Vela Velupillai:
Algorithmic Economics: Incomputability, Undecidability and Unsolvability in Economics. 105-120 - Vlatko Vedral:
Is Quantum Physics Relevant for Life? 123-131 - J. Mark Bishop:
Trouble with Computation: A Refutation of Digital Ontology. 133-140 - Antonina Kolokolova:
Complexity Barriers as Independence. 143-168 - Cristian S. Calude:
Quantum Randomness: From Practice to Theory and Back. 169-181 - André Nies:
Calculus of Cost Functions. 183-216 - Thomas E. Woolley, Ruth E. Baker, Philip K. Maini:
Turing's Theory of Morphogenesis: Where We Started, Where We Are and Where We Want to Go. 219-235 - Aaron Sloman:
Construction Kits for Biological Evolution. 237-292
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.