000 03774nam a22006135i 4500
001 978-3-642-03092-5
003 DE-He213
005 20160624102132.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642030925
_9978-3-642-03092-5
024 7 _a10.1007/978-3-642-03092-5
_2doi
050 4 _aQ334-342
050 4 _aTJ210.2-211.495
072 7 _aUYQ
_2bicssc
072 7 _aTJFM1
_2bicssc
072 7 _aCOM004000
_2bisacsh
082 0 4 _a006.3
_223
245 1 0 _aInfinity in Logic and Computation
_h[electronic resource] :
_bInternational Conference, ILC 2007, Cape Town, South Africa, November 3-5, 2007, Revised Selected Papers /
_cedited by Margaret Archibald, Vasco Brattka, Valentin Goranko, Benedikt Löwe.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2009.
300 _aXIII, 139 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5489
505 0 _aNadia Busi (1968–2007) -- Symbolic Model Checking of Tense Logics on Rational Kripke Models -- Genetic Systems without Inhibition Rules -- Probabilistic Systems with LimSup and LimInf Objectives -- A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata -- Towards Model-Checking Programs with Lists -- Representations of Numbers as :A Saddle Point Approach -- Sets of Infinite Words Recognized by Deterministic One-Turn Pushdown Automata -- Fine-Continuous Functions and Fractals Defined by Infinite Systems of Contractions -- Is P?=?PSPACE for Infinite Time Turing Machines?.
520 _aEdited in collaboration with FoLLI, the Association of Logic, Language and Information, this volume constitutes a selection of papers presented at the Internatonal Conference on Infinity in Logic and Computation, ILC 2007, held in Cape Town, South Africa, in November 2007. The 7 revised papers presented together with 2 invited talks were carefully selected from 27 initial submissions during two rounds of reviewing and improvement. The papers address all aspects of infinity in automata theory, logic, computability and verification and focus on topics such as automata on infinite objects; combinatorics, cryptography and complexity; computability and complexity on the real numbers; infinite games and their connections to logic; logic, computability, and complexity in finitely presentable infinite structures; randomness and computability; transfinite computation; and verification of infinite state systems.
650 0 _aComputer science.
650 0 _aInformation theory.
650 0 _aComputer software.
650 0 _aElectronic data processing.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aTheory of Computation.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aMathematics of Computing.
650 2 4 _aComputing Methodologies.
700 1 _aArchibald, Margaret.
_eeditor.
700 1 _aBrattka, Vasco.
_eeditor.
700 1 _aGoranko, Valentin.
_eeditor.
700 1 _aLöwe, Benedikt.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642030918
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5489
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-03092-5
942 _2EBK8632
_cEBK
999 _c37926
_d37926