Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  10:00-20:00 пн-пт 11-18 сб
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Специальные предложения | Бестселлеры
 

Finite and Algorithmic Model Theory, Esparza



Варианты приобретения
Цена: 6557р.
Кол-во:
 о цене
Наличие: Отсутствует. Возможна поставка под заказ.

При оформлении заказа до: 12 фев 2021
Ориентировочная дата поставки: Начало марта
При условии наличия книги у поставщика.

Добавить в корзину
в Мои желания

Автор: Esparza
Название:  Finite and Algorithmic Model Theory
Издательство: Cambridge Academ
Классификация:
Основы математики
Структуры данных
Алгоритмы и процедуры

ISBN: 0521718201
ISBN-13(EAN): 9780521718202
ISBN: 0-521-71820-1
ISBN-13(EAN): 978-0-521-71820-2
Обложка/Формат: Paperback
Страницы: 356
Вес: 0.518 кг.
Дата издания: 10.03.2011
Серия: London Mathematical Society Lecture Note Series, 379
Язык: English
Иллюстрации: 55 b/w illus.
Размер: 227 x 154 x 18
Читательская аудитория: logic, theoretical computer science
Основная тема: Mathematics
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Англии
Описание: Intended for researchers and graduate students in theoretical computer science and mathematical logic, this volume contains accessible surveys by leading researchers from areas of current work in logical aspects of computer science, where both finite and infinite model-theoretic methods play an important role. Notably, the articles in this collection emphasize points of contact and connections between finite and infinite model theory in computer science that may suggest new directions for interaction. Among the topics discussed are: algorithmic model theory, descriptive complexity theory, finite model theory, finite variable logic, model checking, model theory for restricted classes of finite structures, and spatial databases. The chapters all include extensive bibliographies facilitating deeper exploration of the literature and further research.



Algorithmic Learning Theory / 14th International Conference, ALT 2003, Sapporo, Japan, October 17-19, 2003, Proceedings

Автор: GavaldГ Ricard, Jantke Klaus P., Takimoto Eiji
Название: Algorithmic Learning Theory / 14th International Conference, ALT 2003, Sapporo, Japan, October 17-19, 2003, Proceedings
ISBN: 3540202919 ISBN-13(EAN): 9783540202912
Издательство: Springer
Рейтинг:
Цена: 7314 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 14th International Conference on Algorithmic Learning Theory, ALT 2003, held in Sapporo, Japan in October 2003.The 19 revised full papers presented together with 2 invited papers and abstracts of 3 invited talks were carefully reviewed and selected from 37 submissions. The papers are organized in topical sections on inductive inference, learning and information extraction, learning with queries, learning with non-linear optimization, learning from random examples, and online prediction.

Algorithmic Number Theory / 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings

Автор: Buell Duncan
Название: Algorithmic Number Theory / 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings
ISBN: 3540221565 ISBN-13(EAN): 9783540221562
Издательство: Springer
Цена: 9926 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 6th International Algorithmic Number Theory Symposium, ANTS 2004, held in Burlington, VT, USA, in June 2004.

Algorithmic Learning Theory / 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings

Автор: BalcГЎzar JosГ© L., Long Philip M., Stephan Frank
Название: Algorithmic Learning Theory / 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings
ISBN: 3540466495 ISBN-13(EAN): 9783540466499
Издательство: Springer
Рейтинг:
Цена: 9404 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 17th International Conference on Algorithmic Learning Theory, ALT 2006, held in Barcelona, Spain in October 2006, colocated with the 9th International Conference on Discovery Science, DS 2006.The 24 revised full papers presented together with the abstracts of 5 invited papers were carefully reviewed and selected from 53 submissions. The papers are dedicated to the theoretical foundations of machine learning; they address topics such as query models, on-line learning, inductive inference, algorithmic forecasting, boosting, support vector machines, kernel methods, reinforcement learning, and statistical learning models.

Algorithmic Number Theory / 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings

Автор: Hess Florian, Pauli Sebastian, Pohst Michael
Название: Algorithmic Number Theory / 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings
ISBN: 3540360751 ISBN-13(EAN): 9783540360759
Издательство: Springer
Рейтинг:
Цена: 12539 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 7th International Algorithmic Number Theory Symposium, ANTS 2006, held in Berlin, Germany in July 2006.The 37 revised full papers presented together with 4 invited papers were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections on algebraic number theory, analytic and elementary number theory, lattices, curves and varieties over fields of characteristic zero, curves over finite fields and applications, and discrete logarithms.

Algorithmic Learning Theory / 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings

Автор: Jain Sanjay, Simon Hans Ulrich, Tomita Etsuji
Название: Algorithmic Learning Theory / 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings
ISBN: 354029242X ISBN-13(EAN): 9783540292425
Издательство: Springer
Рейтинг:
Цена: 10449 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 16th International Conference on Algorithmic Learning Theory, ALT 2005, held in Singapore in October 2005.The 30 revised full papers presented together with 5 invited papers and an introduction by the editors were carefully reviewed and selected from 98 submissions. The papers are organized in topical sections on kernel-based learning, bayesian and statistical models, PAC-learning, query-learning, inductive inference, language learning, learning and logic, learning from expert advice, online learning, defensive forecasting, and teaching.

Algorithmic Information Theory / Mathematics of Digital Information Processing

Автор: Seibt Peter
Название: Algorithmic Information Theory / Mathematics of Digital Information Processing
ISBN: 3540332189 ISBN-13(EAN): 9783540332183
Издательство: Springer
Рейтинг:
Цена: 19331 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book treats the Mathematics of many important areas in digital information processing. It covers, in a unified presentation, five topics: Data Compression, Cryptography, Sampling (Signal Theory), Error Control Codes, Data Reduction. The thematic choices are practice-oriented. So, the important final part of the book deals with the Discrete Cosine Transform and the Discrete Wavelet Transform, acting in image compression. The presentation is dense, the examples and numerous exercises are concrete. The pedagogic architecture follows increasing mathematical complexity. A read-and-learn book on Concrete Mathematics, for teachers, students and practitioners in Electronic Engineering, Computer Science and Mathematics.

Algorithmic Learning Theory / 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004. Proceedings

Автор: Ben David Shai, Case John, Maruoka Akira
Название: Algorithmic Learning Theory / 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004. Proceedings
ISBN: 3540233563 ISBN-13(EAN): 9783540233565
Издательство: Springer
Рейтинг:
Цена: 10449 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 15th International Conference on Algorithmic Learning Theory, ALT 2004, held in Padova, Italy in October 2004.The 29 revised full papers presented together with 5 invited papers and 3 tutorial summaries were carefully reviewed and selected from 91 submissions. The papers are organized in topical sections on inductive inference, PAC learning and boosting, statistical supervised learning, online sequence learning, approximate optimization algorithms, logic based learning, and query and reinforcement learning.

Algorithmic Information Theory

Автор: Gregory. J. Chaitin
Название: Algorithmic Information Theory
ISBN: 0521616042 ISBN-13(EAN): 9780521616041
Издательство: Cambridge Academ
Рейтинг:
Цена: 4600 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of G?¶del's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.

Twenty Lectures on Algorithmic Game Theory

Автор: Roughgarden
Название: Twenty Lectures on Algorithmic Game Theory
ISBN: 131662479X ISBN-13(EAN): 9781316624791
Издательство: Cambridge Academ
Рейтинг:
Цена: 2990 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.

Information and Randomness / An Algorithmic Perspective

Автор: Calude Cristian S.
Название: Information and Randomness / An Algorithmic Perspective
ISBN: 3540434666 ISBN-13(EAN): 9783540434665
Издательство: Springer
Рейтинг:
Цена: 8355 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The book presents in a mathematical clear way the fundamentals of algorithmic information theory and a few selected applications. This 2nd edition presents new and important results obtained in recent years: the characterization of computable enumerable random reals, the construction of an Omega Number for which ZFC cannot determine any digits, and the first successful attempt to compute the exact values of 64 bits of a specific Omega Number. Finally, the book contains a discussion of some interesting philosophical questions related to randomness and mathematical knowledge. "Professor Calude has produced a first-rate exposition of up-to-date work in information and randomness." D.S. Bridges, Canterbury University, co-author, with Errett Bishop, of Constructive Analysis;"The second edition of this classic work is highly recommended to anyone interested in algorithmic information and randomness." G.J. Chaitin, IBM Research Division, New York, author of Conversations with a Mathematician; "This book is a must for a comprehensive introduction to algorithmic information theory and for anyone interested in its applications in the natural sciences." K. Svozil, Technical University of Vienna, author of Randomness & Undecidability in Physics

Methods in Algorithmic Analysis

Автор: Dobrushkin
Название: Methods in Algorithmic Analysis
ISBN: 1420068296 ISBN-13(EAN): 9781420068290
Издательство: Taylor&Francis
Рейтинг:
Цена: 19058 р.
Наличие на складе: Поставка под заказ.

Описание: Accompanied by more than 1,000 examples and exercises, this comprehensive, classroom-tested text presents numerous theories, techniques, and methods used for analyzing algorithms. It includes basic material on combinatorics and probability that can be used for students with weak backgrounds. It presents information on asymptotics not usually found in similar books, including Rice’s method, the Euler and Boole summation formulas, and recurrences. The author offers tutorials throughout the text on topics as diverse as continued fractions, functions of a complex variable, numerical calculations, and Stieltjes integration. An appendix contains a comprehensive collection of useful formulas.

Combinatorial and Algorithmic Aspects of Networking / Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers

Автор: Erlebach Thomas
Название: Combinatorial and Algorithmic Aspects of Networking / Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers
ISBN: 3540488227 ISBN-13(EAN): 9783540488224
Издательство: Springer
Цена: 6791 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the thoroughly refereed post-proceedings of the Third Workshop on Combinatorial and Algorithmic Aspects of Networking, held in Chester, UK in July 2006, co-located with the 13th Colloquium on Structural Information and Communication Complexity, SIROCCO 2006.The 10 revised full papers together with 1 invited lecture presented were carefully reviewed and selected from a total of 22 submissions. The topics covered range from the Web graph to game theory to string matching, all in the context of large-scale networks.


ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте     В Контакте Мед  Мобильная версия