How the World Computes

(ed.)
(2012)
Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Buy this book Find it on Amazon.com
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,355
External links
  • This entry has no external links. Add one.

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
Chapters BETA
Ordinal Analysis and the Infinite Ramsey Theorem.Bahareh Afshari & Michael Rathjen
Curiouser and Curiouser: The Link Between Incompressibility and Complexity.Eric Allender
Information and Logical Discrimination.Patrick Allo
Robustness of Logical Depth.Luís Antunes, Andre Souto & Andreia Teixeira
Turing's Normal Numbers: Towards Randomness.Verónica Becher
Logic of Ruler and Compass Constructions.Michael Beeson
Square Roots and Powers in Constructive Banach Algebra Theory.Douglas S. Bridges & Robin S. Havea
A Note on Ramsey Theorems and Turing Jumps.Lorenzo Carlucci & Konrad Zdanowski
An Undecidable Nested Recurrence Relation.Marcel Celaya & Frank Ruskey
Hard Instances of Algorithms and Proof Systems.Yijia Chen, Jörg Flum & Moritz Müller
On Mathias Generic Sets.Peter A. Cholak, Damir D. Dzhafarov & Jeffry L. Hirst
Local Induction and Provably Total Computable Functions: A Case Study.Andrés Cordón–Franco & F. Félix Lara–Martín
Complexity of Deep Inference Via Atomic Flows.Anupam Das
Connecting Partial Words and Regular Languages.Jürgen Dassow, Florin Manea & Robert Mercaş
Randomness, Computation and Mathematics.Rod Downey
Learning, Social Intelligence and the Turing Test.Bruce Edmonds & Carlos Gershenson
Highness and Local Noncappability.Chengling Fang, Wang Shenling & Guohua Wu
A Short Note on Spector's Proof of Consistency of Analysis.Fernando Ferreira
On the Foundations and Philosophy of Info-Metrics.Amos Golan
On Mathematicians Who Liked Logic.Ivor Grattan-Guinness
Densities and Entropies in Cellular Automata.Pierre Guillon & Charalampos Zinoviadis
Foundational Analyses of Computation.Yuri Gurevich
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs.Sepp Hartung & André Nichterlein
Turing Machine-Inspired Computer Science Results.Juris Hartmanis
A Direct Proof of Wiener's Theorem.Matthew Hendtlass & Peter Schuster
Effective Strong Nullness and Effectively Closed Sets.Kojiro Higuchi & Takayuki Kihara
Word Automaticity of Tree Automatic Scattered Linear Orderings is Decidable.Martin Huschenbett
On Immortal Configurations in Turing Machines.Emmanuel Jeandel
A Slime Mold Solver for Linear Programming Problems.Anders Johannson & James Zou
Tree-Automatic Well-Founded Trees.Alexander Kartzow, Jiamou Liu & Markus Lohrey
A Hierarchy of Immunity and Density for Sets of Reals.Takayuki Kihara
How Much Randomness is Needed for Statistics?Bjørn Kjos-Hanssen, Antoine Taveneaux & Neil Thapen
Towards a Theory of Infinite Time Blum-Shub-Smale Machines.Peter Koepke & Benjamin Seyfferth
Turing Pattern Formation Without Diffusion.Shigeru Kondo
Degrees of Total Algorithms Versus Degrees of Honest Functions.Lars Kristiansen
A 5n− o (N) Lower Bound on the Circuit Size Over U 2 of a Linear Boolean Function.Alexander S. Kulikov, Olga Melanich & Ivan Mihajlin
What is Turing's Comparison Between Mechanism and Writing Worth?Jean Lassègue & Giuseppe Longo
The Computing Spacetime.Fotini Markopoulou
Unifiability and Admissibility in Finite Algebras.George Metcalfe & Christoph Röthlisberger
After Turing: Mathematical Modelling in the Biomedical and Social Sciences.James D. Murray
Existence of Faster Than Light Signals Implies Hypercomputation Already in Special Relativity.Péter Németi & Gergely Székely
Turing Computable Embeddings and Coding Families of Sets.Víctor A. Ocasio-González
Multi-Valued Functions in Computability Theory.Arno Pauly
On the Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Prime Models.Mikhail G. Peretyat’kin
Lower Bound on Weights of Large Degree Threshold Functions.Vladimir V. Podolskii
What Are Computers (If They're Not Thinking Things)?John Preston
Compactness and the Effectivity of Uniformization.Robert Rettinger
On Shift Spaces with Algebraic Structure.Ville Salo & Ilkka Törmä
On the Behavior of Tile Assembly System at High Temperatures.Shinnosuke Seki & Yasushi Okuno
Game Arguments in Computability Theory and Algorithmic Information Theory.Alexander Shen
Turing Patterns in Deserts.Jonathan A. Sherratt
Subsymbolic Computation Theory for the Human Intuitive Processor.Paul Smolensky
Bringing Up Turing's 'Child-Machine'.Susan G. Sterrett
Low N Boolean Subalgebras.Rebecca M. Steiner
Is Turing's Thesis the Consequence of a More General Physical Principle?Matthew P. Szudzik
Some Natural Zero One Laws for Ordinals Below Ε 0.Andreas Weiermann & Alan R. Woods
On the Road to Thinking Machines: Insights and Ideas.Jiří Wiedermann
Infinite Games and Transfinite Recursion of Multiple Inductive Definitions.Keisuke Yoshii & Kazuyuki Tanaka
Making Solomonoff Induction Effective.Jörg Zimmermann & Armin B. Cremers

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Every 1-Generic Computes a Properly 1-Generic.Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt & Joseph S. Miller - 2006 - Journal of Symbolic Logic 71 (4):1385 - 1393.
Physical Hypercomputation and the Church–Turing Thesis.Oron Shagrir & Itamar Pitowsky - 2003 - Minds and Machines 13 (1):87-101.
Derrida and Connectionism: Differance in Neural Nets.Gordon G. Globus - 1992 - Philosophical Psychology 5 (2):183-97.
A Computable ℵ 0 -Categorical Structure Whose Theory Computes True Arithmetic.Bakhadyr Khoussainov & Antonio Montalbán - 2010 - Journal of Symbolic Logic 75 (2):728-740.
More About Uniform Upper Bounds on Ideals of Turing Degrees.Harold T. Hodes - 1983 - Journal of Symbolic Logic 48 (2):441-457.
Mass Problems and Randomness.Stephen G. Simpson - 2005 - Bulletin of Symbolic Logic 11 (1):1-27.
Vector Subtraction Implemented Neurally: A Neurocomputational Model of Some Sequential Cognitive and Conscious Processes.John Bickle, Cindy Worley & Marica Bernstein - 2000 - Consciousness and Cognition 9 (1):117-144.
Informational Branching Universe.Pierre Uzan - 2010 - Foundations of Science 15 (1):1-28.
World History: The Basics.Peter N. Stearns - 2010 - Routledge.
I Have Recently Had an E-Mail From Mr Evin Harris of Trinity College Dublin.J. R. Lucas - manuscript
MaGIC: Matrix Generator for Implication Connectives.Branden Fitelson - manuscript
Vision, Reanimated and Reimagined.Shimon Edelman - unknown
Bringing Up Turing's 'Child-Machine'.Susan G. Sterrett - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 703--713.

Analytics

Added to PP index
2013-08-28

Total views
0

Recent downloads (6 months)
0

How can I increase my downloads?

Downloads

Sorry, there are not enough data points to plot this chart.

My notes



Home | New books and articles | Bibliographies | Philosophy journals | Discussions | Article Index | About PhilPapers | API | Contact us | Code of conduct

CDP Phiosophy Documentation Center
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation

Server: philpapers-web-584f896dc5-vqctr N