Vor Ort
Merkzettel Warenkorb
  • Produktbild: Evolving Computability
  • Produktbild: Evolving Computability
  • Produktbild: Evolving Computability
Band 9136

Evolving Computability 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29-July 3, 2015. Proceedings

Aus der Reihe Lecture Notes in Computer Science

51,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

09.06.2015

Abbildungen

XV, 20 illus., schwarz-weiss Illustrationen

Herausgeber

Arnold Beckmann + weitere

Verlag

Springer

Seitenzahl

363

Maße (L/B/H)

23,5/15,5/2,1 cm

Gewicht

575 g

Auflage

2015

Sprache

Englisch

ISBN

978-3-319-20027-9

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

09.06.2015

Abbildungen

XV, 20 illus., schwarz-weiss Illustrationen

Herausgeber

Verlag

Springer

Seitenzahl

363

Maße (L/B/H)

23,5/15,5/2,1 cm

Gewicht

575 g

Auflage

2015

Sprache

Englisch

ISBN

978-3-319-20027-9

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Evolving Computability
  • Produktbild: Evolving Computability
  • Produktbild: Evolving Computability

  • Computers and the Mechanics of Communication. Outline of a Vision from the Work of Petri and Holt.- Error and predicativity.- Is Human Mind Fully Algorithmic? Remarks on Kurt Godel's Incompleteness Theorems.- A New Approach to the Paperfolding Sequences.- Covering the Recursive Sets.- On Distributed Monitoring and Synthesis.- Newton's Forward Difference Equation for Functions from Words to Words.- Degrees of unsolvability: a tutorial.- Universality in Molecular and Cellular Computing.- Some results on interactive proofs for real computations.- Prime Model with No Degree of Autostability Relative to Strong Constructivizations.- Immune Systems in Computer Virology.- ITRM-Recognizability from Random Oracles.- Systems with Parallel Rewriting for Chain Code Picture Languages.- Base-Complexity Classifications of QCB0-Spaces (Extended Abstract).- Maximal Vector Spaces form an Automorphism Basis.- New Bounds on Optimal Sorting Networks.- Nonexistence of Minimal Pairs in L[d].- Intuitionistic Provability versus Uniform Provability in RCA.- Randomness and Differentiability of Convex Functions.- Weighted automata on infinite words in the context of Attacker-Defender games.- Turing jumps through provability.- Rice's Theorem in Effectively Enumerable Topological Spaces.- Decidability of Termination Problems for Sequential P Systems with Active Membranes.- Weihrauch degrees of finding equilibria in sequential games.- Prefix and Right-Partial Derivative Automata.- A Note on the Computable Categoricity of l^p Spaces.- n the Computational Content of Termination Proofs.- Local compactness for computable Polish metric spaces is $\Pi^1_1$-complete.- Iterative forcing and hyperimmunity in reverse mathematics.- Completely regular Bishop spaces.- Computing Equality-Free String Factorisations.- Towards the Effective Descriptive Set Theory.- On Computability of Navier-Stokes' Equation.- Undecidability as a Consequence of Incompleteness.- How to compare Buchholz-style ordinal notation systems with Gordeev-style notation systems.