Resultados de Pesquisa

INGLÊS

Computable Structure Theory - A Unified Approach

de Alexander Melnikov e Rodney G. Downey

~~148,70€~~ 133,83€ 10% IMEDIATO

portes grátis

 This is the first book which gives a unified theory for countable and uncountable computable structures. The work treats computable linear orderings, graphs, groups and Boolean algebras unified with computable metric and Banach spaces, profinite groups, and the like.
INGLÊS

Restarting Automata - Extensions And Generalizations

de Friedrich Otto

~~243,33€~~ 219,00€ 10% IMEDIATO

portes grátis

 Other topics include the descriptional complexity and inductive inference of certain types of restarting automata, cooperating distributed and parallel communicating systems of restarting automata, restarting automata with output, weighted restarting automata, and restarting automata for picture languages and tree languages.
INGLÊS

Restarting Automata - The Standard Type Of Restarting Automaton And Its Variants

de Friedrich Otto

~~243,33€~~ 219,00€ 10% IMEDIATO

portes grátis

 Other topics include the descriptional complexity and inductive inference of certain types of restarting automata, cooperating distributed and parallel communicating systems of restarting automata, restarting automata with output, weighted restarting automata, and restarting automata for picture languages and tree languages.
INGLÊS

Restarting Automata - Extensions And Generalizations

de Friedrich Otto

~~237,84€~~ 214,06€ 10% IMEDIATO

DISPONIBILIDADE IMEDIATA

 Other topics include the descriptional complexity and inductive inference of certain types of restarting automata, cooperating distributed and parallel communicating systems of restarting automata, restarting automata with output, weighted restarting automata, and restarting automata for picture languages and tree languages.
INGLÊS

Reverse Mathematics - Problems, Reductions, And Proofs

de Carl Mummert e Damir D. Dzhafarov

81,10€ + 10% EM CARTÃO

portes grátis

 Reverse mathematics studies the complexity of proving mathematical theorems and solving mathematical problems.
INGLÊS

Restarting Automata - The Standard Type Of Restarting Automaton And Its Variants

de Friedrich Otto

~~238,49€~~ 214,64€ 10% IMEDIATO

DISPONIBILIDADE IMEDIATA

 Other topics include the descriptional complexity and inductive inference of certain types of restarting automata, cooperating distributed and parallel communicating systems of restarting automata, restarting automata with output, weighted restarting automata, and restarting automata for picture languages and tree languages.
INGLÊS

Programs As Diagrams - From Categorical Computability To Computable Categories

de Dusko Pavlovic

72,86€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 It is not always clear what computer programs mean in the various languages in which they can be written, yet a picture can be worth 1000 words, a diagram 1000 instructions.In this unique textbook/reference, programs are drawn as string diagrams in the language of categories, which display a universal syntax of mathematics (Computer scientists use them to analyze the program semantics; programmers to display the syntax of computations). Here, the string-diagrammatic depictions of computations are construed as programs in a single-instruction programming language. Such programs as diagrams show how functions are packed in boxes and tied by strings. Readers familiar with categories will learn about the foundations of computability; readers familiar with computability gain access to category theory. Additionally, readers familiar with both are offered many opportunities to improve the approach.Topics and features:<ul><li>Delivers a ‘crash’ diagram-based course in theory of computation</li><li>Uses single-instruction diagrammatic programming language</li><li>Offers a practical introduction into categories and string diagrams as computational tools</li><li>Reveals how computability is programmability, rather than an ‘ether’ permeating computers </li><li>Provides a categorical model of intensional computation is unique up to isomorphism</li><li>Serves as a stepping stone into research of computable categories</li></ul>In addition to its early chapters introducing computability for beginners, this flexible textbook/resource also contains both middle chapters that expand for suitability to a graduate course as well as final chapters opening up new research. Dusko Pavlovic is a professor at the Department of Information and Computer Sciences at the University of Hawaii at Manoa, and by courtesy at the Department of Mathematics and the College of Engineering. He completed this book as an Excellence Professor at Radboud University in Nijmegen, The Netherlands.
INGLÊS

Reverse Mathematics - Problems, Reductions, And Proofs

de Carl Mummert e Damir D. Dzhafarov

79,49€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 Reverse mathematics studies the complexity of proving mathematical theorems and solving mathematical problems.
INGLÊS

Reverse Mathematics - Problems, Reductions, And Proofs

de Carl Mummert e Damir D. Dzhafarov

121,66€ + 10% EM CARTÃO

portes grátis

 Reverse mathematics studies the complexity of proving mathematical theorems and solving mathematical problems.
INGLÊS

Handbook Of Computability And Complexity In Analysis

79,49€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 Computable analysis is the modern theory of computability and complexity in analysis that arose out of Turing''s seminal work in the 1930s. This was motivated by questions such as: which real numbers and real number functions are computable, and which mathematical tasks in analysis can be solved by algorithmic means?Nowadays this theory has many different facets that embrace topics from computability theory, algorithmic randomness, computational complexity, dynamical systems, fractals, and analog computers, up to logic, descriptive set theory, constructivism, and reverse mathematics. In recent decades computable analysis has invaded many branches of analysis, and researchers have studied computability and complexity questions arising from real and complex analysis, functional analysis, and the theory of differential equations, up to (geometric) measure theory and topology. This handbook represents the first coherent cross-section through most active research topics on the more theoretical side of the field. It contains 11 chapters grouped into parts on computability in analysis; complexity, dynamics, and randomness; and constructivity, logic, and descriptive complexity. All chapters are written by leading experts working at the cutting edge of the respective topic. Researchers and graduate students in the areas of theoretical computer science and mathematical logic will find systematic introductions into many branches of computable analysis, and a wealth of information and references that will help them to navigate the modern research literature in this field.
INGLÊS

The Incomputable - Journeys Beyond The Turing Barrier

148,70€ + 10% EM CARTÃO

portes grátis

 This book questions the relevance of computation to the physical universe.
INGLÊS

Turing Computability - Theory And Applications

de Robert I. Soare

74,34€ + 10% EM CARTÃO

portes grátis

 Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This book presents classical computability theory from Turing and Post to current results and methods, and their use in studying the information content of algebraic structures, models, and their relation to Peano arithmetic.
INGLÊS

Turing Computability - Theory And Applications

de Robert I. Soare

72,86€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This book presents classical computability theory from Turing and Post to current results and methods, and their use in studying the information content of algebraic structures, models, and their relation to Peano arithmetic.
INGLÊS

Higher-Order Computability

de Dag Normann e John Longley

189,25€ + 10% EM CARTÃO

portes grátis

 This book offers a self-contained exposition of the theory of computability in a higher-order context, where 'computable operations' may themselves be passed as arguments to other computable operations.
INGLÊS

Algorithmic Randomness And Complexity

de Denis R. Hirschfeldt e Rodney G. Downey

98,02€ + 10% EM CARTÃO

portes grátis

 The theory of algorithmic randomness uses tools from computability theory and algorithmic information theory to address questions such as these. It will be of interest to researchers and students in computability theory, algorithmic information theory, and theoretical computer science.
INGLÊS

Incomputable - Journeys Beyond The Turing Barrier

145,09€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 This book questions the relevance of computation to the physical universe.
INGLÊS

Apartness And Uniformity - A Constructive Development

de Douglas S. Bridges e Luminita Simona Vita

118,59€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 This book presents a theory of apartness encompassing both point-set topology and the theory of uniform spaces. The first book on the apartness approach to constructive topology, it is a valuable addition to the literature on topology in computer science.
INGLÊS

Higher-Order Computability

de Dag Normann e John Longley

184,84€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 This book offers a self-contained exposition of the theory of computability in a higher-order context, where 'computable operations' may themselves be passed as arguments to other computable operations.
INGLÊS

Turing Computability - Theory And Applications

de Robert I. Soare

101,38€ + 10% EM CARTÃO

portes grátis

 Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This book presents classical computability theory from Turing and Post to current results and methods, and their use in studying the information content of algebraic structures, models, and their relation to Peano arithmetic.
INGLÊS

Algorithmic Randomness And Complexity

de Denis R. Hirschfeldt e Rodney G. Downey

127,86€ + 10% EM CARTÃO

DISPONIBILIDADE IMEDIATA

 Computability and complexity theory are two central areas of research in theoretical computer science. This book presents a systematic, technical development of 'algorithmic randomness' and complexity for scientists from diverse fields.
INGLÊS

Handbook Of Computability And Complexity In Analysis

81,10€ + 10% EM CARTÃO

portes grátis
INGLÊS

Handbook Of Computability And Complexity In Analysis

121,66€ + 10% EM CARTÃO

portes grátis
INGLÊS

Computational Artifacts - Towards A Philosophy Of Computer Science

de Raymond Turner

202,77€ + 10% EM CARTÃO

portes grátis
INGLÊS

Programs As Diagrams - From Categorical Computability To Computable Categories

de Dusko Pavlovic

66,91€

portes grátis

ESGOTADO OU NÃO DISPONÍVEL
A carregar resultados...

Ver mais resultados