000			03640nam a22003615i 4500
001			319920
003			MX-SnUAN
005			20160429161332.0
007			cr nn 008mamaa
008			160111s2015 gw | s |||| 0|eng d
020			_a9783319200286 _9978-3-319-20028-6
035			_avtls000421504
039		9	_y201601111000 _zstaff
050		4	_aQA75.5-76.95
245	1	0	_aEvolving computability : _b11th conference on computability in europe, cie 2015, bucharest, romania, june 29-july 3, 2015. Proceedings / _cedited by Arnold Beckmann, Victor Mitrana, Mariya Soskova.
264		1	_aCham : _bSpringer International Publishing : _bSpringer, _c2015.
300			_axv, 363 páginas : _b20 ilustraciones
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
490	0		_aLecture Notes in Computer Science, _x0302-9743 ; _v9136
500			_aSpringer eBooks
505	0		_aComputers 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.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aBeckmann, Arnold, _eeditor. _9330555
700	1		_aMitrana, Victor, _eeditor. _9330972
700	1		_aSoskova, Mariya, _eeditor. _9364379
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783319200279
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-319-20028-6 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c319920 _d319920