000			05955nam a22004095i 4500
001			295852
003			MX-SnUAN
005			20160429155242.0
007			cr nn 008mamaa
008			150903s2006 gw | o |||| 0|eng d
020			_a9783540354680 _99783540354680
024	7		_a10.1007/11780342 _2doi
035			_avtls000349083
039		9	_a201509030747 _bVLOAD _c201404121159 _dVLOAD _c201404090936 _dVLOAD _y201402071154 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA75.5-76.95
100	1		_aBeckmann, Arnold. _eeditor. _9330555
245	1	0	_aLogical Approaches to Computational Barriers : _bSecond Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006. Proceedings / _cedited by Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2006.
300			_axv, 608 páginas Also available online. _brecurso en línea.
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 ; _v3988
500			_aSpringer eBooks
505	0		_aHeap-Abstraction for an Object-Oriented Calculus with Thread Classes -- From Constructibility and Absoluteness to Computability and Domain Independence -- Datatype-Generic Reasoning -- The Logical Strength of the Uniform Continuity Theorem -- Elementary Algebraic Specifications of the Rational Function Field -- Random Closed Sets -- Deep Inference and Its Normal Form of Derivations -- Logspace Complexity of Functions and Structures -- Prefix-Like Complexities and Computability in the Limit -- Partial Continuous Functions and Admissible Domain Representations -- An Invariant Cost Model for the Lambda Calculus -- On the Complexity of the Sperner Lemma -- The Church-Turing Thesis: Consensus and Opposition -- Gödel and the Origins of Computer Science -- The Role of Algebraic Models and Type-2 Theory of Effectivity in Special Purpose Processor Design -- Turing Universality in Dynamical Systems -- Every Sequence Is Decompressible from a Random One -- Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal -- LJQ: A Strongly Focused Calculus for Intuitionistic Logic -- Böhm Trees, Krivine’s Machine and the Taylor Expansion of Lambda-Terms -- What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem? -- An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability -- Enumeration Reducibility with Polynomial Time Bounds -- Coinductive Proofs for Basic Real Computation -- A Measure of Space for Computing over the Reals -- On Graph Isomorphism for Restricted Graph Classes -- Infinite Time Register Machines -- Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems -- Forcing with Random Variables and Proof Complexity -- Complexity-Theoretic Hierarchies -- Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests -- Lower Bounds Using Kolmogorov Complexity -- The Jump Classes of Minimal Covers -- Space Bounds for Infinitary Computation -- From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials -- Towards a Trichotomy for Quantified H-Coloring -- Two Open Problems on Effective Dimension -- Optimization and Approximation Problems Related to Polynomial System Solving -- Uncomputability Below the Real Halting Problem -- Constraints on Hypercomputation -- Martingale Families and Dimension in P -- Can General Relativistic Computers Break the Turing Barrier? -- Degrees of Weakly Computable Reals -- Understanding and Using Spector’s Bar Recursive Interpretation of Classical Analysis -- A Subrecursive Refinement of the Fundamental Theorem of Algebra -- An Introduction to Program and Thread Algebra -- Fast Quantifier Elimination Means P = NP -- Admissible Representations in Computable Analysis -- Do Noetherian Modules Have Noetherian Basis Functions? -- Inverting Monotone Continuous Functions in Constructive Analysis -- Partial Recursive Functions in Martin-Löf Type Theory -- Partially Ordered Connectives and ?1 1 on Finite Models -- Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes -- Gödel’s Conflicting Approaches to Effective Calculability -- Co-total Enumeration Degrees -- Relativized Degree Spectra -- Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions -- Non-deterministic Halting Times for Hamkins-Kidder Turing Machines -- Kurt Gödel and Computability Theory -- A Computability Theory of Real Numbers -- Primitive Recursive Selection Functions over Abstract Algebras.
520			_aThis book constitutes the refereed proceedings of the Second International Conference on Computability in Europe, CiE 2006, held in Swansea, UK, in June/July 2006. The 31 revised full papers presented together with 30 invited papers were carefully reviewed and selected from about 80 submissions. Among them are papers corresponding to 8 plenary talks and papers of 6 special sessions entitled proofs and computation, computable analysis, challenges in complexity, foundations of programming, mathematical models of computers and hypercomputers, and Gödel centenary: Gödel's legacy for computability.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aBerger, Ulrich. _eeditor. _9330556
700	1		_aLöwe, Benedikt. _eeditor. _9305010
700	1		_aTucker, John V. _eeditor. _9330557
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783540354666
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/11780342 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c295852 _d295852