Infinity in Logic and Computation : International Conference, ILC 2007, Cape Town, South Africa, November 3-5, 2007, Revised Selected Papers / edited by Margaret Archibald, Vasco Brattka, Valentin F. Goranko, Benedikt Löwe.

Format:

Book

Contributor:

Archibald, Margaret, editor.

Brattka, Vasco, 1966- editor.

Goranko, Valentin F., editor.

Löwe, Benedikt, editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

Lecture notes in computer science. Lecture notes in artificial intelligence ; 5489.

Lecture Notes in Artificial Intelligence ; 5489

Language:

English

Subjects (All):

Artificial intelligence.

Computer programming.

Programming languages (Electronic computers).

Computers.

Algorithms.

Logic, Symbolic and mathematical.

Artificial Intelligence.

Programming Techniques.

Programming Languages, Compilers, Interpreters.

Theory of Computation.

Algorithm Analysis and Problem Complexity.

Mathematical Logic and Formal Languages.

Local Subjects:

Artificial Intelligence.

Programming Techniques.

Programming Languages, Compilers, Interpreters.

Theory of Computation.

Algorithm Analysis and Problem Complexity.

Mathematical Logic and Formal Languages.

Physical Description:

1 online resource (XIII, 139 pages).

Edition:

First edition 2009.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.

System Details:

text file PDF

Summary:

Edited 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.

Contents:

Nadia 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?.

Other Format:

Printed edition:

ISBN:

978-3-642-03092-5

9783642030925

Access Restriction:

Restricted for use by site license.