How the world computes : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings, edited by S. Barry Cooper, Anuj Dawar, Benedikt Löwe

Resource Information

The instance How the world computes : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings, edited by S. Barry Cooper, Anuj Dawar, Benedikt Löwe represents a material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries. This resource is a combination of several types including: Instance, Electronic.

The Resource How the world computes : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings, edited by S. Barry Cooper, Anuj Dawar, Benedikt Löwe

Image: http://images.btol.com/ContentCafe/Jacket.aspx?UserID=ebsco-test&Password=ebsco-test&Return=T&Value=9783642308703&Type=L

Label: How the world computes : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings, edited by S. Barry Cooper, Anuj Dawar, Benedikt Löwe

Title remainder: Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings

Statement of responsibility: edited by S. Barry Cooper, Anuj Dawar, Benedikt Löwe

Instantiates

How the world computes : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings

Publication

Berlin | New York, Springer, ©2012

Antecedent source: unknown

Bibliography note: Includes bibliographical references and author index

Carrier category: online resource

Carrier category code

Carrier MARC source: rdacarrier

Color: multicolored

Content category: text

Content type code

Content type MARC source: rdacontent

Contents

Luís Antunes, Andre Souto and Andreia Teixeira
Turing's Normal Numbers: Towards Randomness
Verónica Becher
Logic of Ruler and Compass Constructions
Michael Beeson
On the Computational Content of the Brouwer Fixed Point Theorem
Vasco Brattka, Stéphane Le Roux and Arno Pauly
Square Roots and Powers in Constructive Banach Algebra Theory
Douglas S. Bridges and Robin S. Havea
The Mate-in-n Problem of Infinite Chess Is Decidable
Dan Brumleve, Joel David Hamkins and Philipp Schlicht
A Note on Ramsey Theorems and Turing Jumps
Lorenzo Carlucci and Konrad Zdanowski
Automatic Functions, Linear Time and Learning
John Case, Sanjay Jain, Samuel Seah and Frank Stephan
An Undecidable Nested Recurrence Relation
Marcel Celaya and Frank Ruskey
Hard Instances of Algorithms and Proof Systems
Yijia Chen, Jörg Flum and Moritz Müller
On Mathias Generic Sets
Ordinal Analysis and the Infinite Ramsey Theorem
Peter A. Cholak, Damir D. Dzhafarov and Jeffry L. Hirst
Complexity of Deep Inference via Atomic Flows
Anupam Das
Connecting Partial Words and Regular Languages
Jürgen Dassow, Florin Manea and Robert Mercaş
Bahareh Afshari and Michael Rathjen
Curiouser and Curiouser: The Link between Incompressibility and Complexity
Eric Allender
Information and Logical Discrimination
Patrick Allo
Robustness of Logical Depth
Chengling Fang, Wang Shenling and Guohua Wu
Turing Progressions and Their Well-Orders
David Fernández Duque and Joost J. Joosten
A Short Note on Spector's Proof of Consistency of Analysis
Fernando Ferreira
Sets of Signals, Information Flow, and Folktales
Mark Alan Finlayson
On the Foundations and Philosophy of Info-metrics
Amos Golan
On Mathematicians Who Liked Logic
Randomness, Computation and Mathematics
The Case of Max Newman
Ivor Grattan-Guinness
Densities and Entropies in Cellular Automata
Pierre Guillon and Charalampos Zinoviadis
Foundational Analyses of Computation
Yuri Gurevich
Turing Machine-Inspired Computer Science Results
Juris Hartmanis
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs
Sepp Hartung and André Nichterlein
Rod Downey
A Direct Proof of Wiener's Theorem
Matthew Hendtlass and Peter Schuster
Effective Strong Nullness and Effectively Closed Sets
Kojiro Higuchi and Takayuki Kihara
Learning, Social Intelligence and the Turing Test
Why an "Out-of-the-Box" Turing Machine Will Not Pass the Turing Test
Bruce Edmonds and Carlos Gershenson
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization
Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier and Olga Runge
Highness and Local Noncappability
Multi-scale Modeling of Gene Regulation of Morphogenesis
Jaap A. Kaandorp, Daniel Botman, Carlos Tamulonis and Roland Dries
Tree-Automatic Well-Founded Trees
Alexander Kartzow, Jiamou Liu and Markus Lohrey
Infinite Games and Transfinite Recursion of Multiple Inductive Definitions
Keisuke Yoshii and Kazuyuki Tanaka
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 and Neil Thapen
Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable
Towards a Theory of Infinite Time Blum-Shub-Smale Machines
Peter Koepke and 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 U2 of a Linear Boolean Function
Alexander S. Kulikov, Olga Melanich and Ivan Mihajlin
Local Induction and Provably Total Computable Functions: A Case Study
Andrés Cordón-Franco and F. Félix Lara-Martín
Martin Huschenbett
On the Relative Succinctness of Two Extensions by Definitions of Multimodal Logic
Wiebe van der Hoek, Petar Iliev and Barteld Kooi
On Immortal Configurations in Turing Machines
Emmanuel Jeandel
A Slime Mold Solver for Linear Programming Problems
Anders Johannson and James Zou
Natural Signs
Ruth Garrett Millikan
Characteristics of Minimal Effective Programming Systems
Samuel E. Moelius III
After Turing: Mathematical Modelling in the Biomedical and Social Sciences
From Animal Coat Patterns to Brain Tumours to Saving Marriages
James D. Murray
Existence of Faster than Light Signals Implies Hypercomputation already in Special Relativity
Péter Németi and Gergely Székely
Turing Computable Embeddings and Coding Families of Sets
What is Turing's Comparison between Mechanism and Writing Worth?
Víctor A. Ocasio-González
On the Behavior of Tile Assembly System at High Temperatures
Shinnosuke Seki and Yasushi Okuno
Abstract Partial Cylindrical Algebraic Decomposition I: The Lifting Phase
Grant Olney Passmore and Paul B. Jackson
Multi-valued Functions in Computability Theory
Arno Pauly
Relative Randomness for Martin-Löf Random Sets
NingNing Peng, Kojiro Higuchi, Takeshi Yamazaki and Kazuyuki Tanaka
On the Tarski-Lindenbaum Algebra of the Class of all Strongly Constructivizable Prime Models
Jean Lassègue and Giuseppe Longo
Mikhail G. Peretyat'kin
Substitutions and Strongly Deterministic Tilesets
Bastien Le Gloannec and Nicolas Ollinger
The Computing Spacetime
Fotini Markopoulou
Unifiability and Admissibility in Finite Algebras
George Metcalfe and Christoph Röthlisberger

Control code: 794843121

Dimensions: unknown

Extent: 1 online resource.

File format: unknown

Form of item: online

Isbn: 9783642308703

Lccn: 2012938860

Level of compression: unknown

Media category: computer

Media MARC source: rdamedia

Media type code

Other control number: 10.1007/978-3-642-30870-3

Quality assurance targets: not applicable

Record ID: .b130022317

Reformatting quality: unknown

Sound: unknown sound

Specific material designation: remote

System control number: (OCoLC)794843121

Context

Context of How the world computes : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings, edited by S. Barry Cooper, Anuj Dawar, Benedikt Löwe

Context

Item

Instantiates