Skip to main content

Books in Theory and mathematics general

31-40 of 157 results in All results

Nonlinear Boundary Value Problems in Science and Engineering

  • 1st Edition
  • Volume 183
  • November 14, 1989
  • C. Rogers + 1 more
  • English
  • eBook
    9 7 8 - 0 - 0 8 - 0 9 5 8 7 0 - 5
Overall, our object has been to provide an applications-oriented text that is reasonably self-contained. It has been used as the basis for a graduate-level course both at the University of Waterloo and at the Centro Studie Applicazioni in Tecnologie Avante, Bari, Italy. The text is aimed, in the main, at applied mathematicians with a strong interest in physical applications or at engineers working in theoretical mechanics.

Computability, Complexity, Logic

  • 1st Edition
  • Volume 128
  • July 1, 1989
  • E. Börger
  • English
  • eBook
    9 7 8 - 0 - 0 8 - 0 8 8 7 0 4 - 3
The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems.The book is a unified introduction to the modern theory of these concepts, to the way in which they developed first in mathematical logic and computability theory and later in automata theory, and to the theory of formal languages and complexity theory. Apart from considering the fundamental themes and classical aspects of these areas, the subject matter has been selected to give priority throughout to the new aspects of traditional questions, results and methods which have developed from the needs or knowledge of computer science and particularly of complexity theory.It is both a textbook for introductory courses in the above-mentioned disciplines as well as a monograph in which further results of new research are systematically presented and where an attempt is made to make explicit the connections and analogies between a variety of concepts and constructions.

Classical Recursion Theory

  • 1st Edition
  • Volume 125
  • January 1, 1989
  • P. Odifreddi
  • English
  • eBook
    9 7 8 - 0 - 0 8 - 0 8 8 6 5 9 - 6
1988 marked the first centenary of Recursion Theory, since Dedekind's 1888 paper on the nature of number. Now available in paperback, this book is both a comprehensive reference for the subject and a textbook starting from first principles.Among the subjects covered are: various equivalent approaches to effective computability and their relations with computers and programming languages; a discussion of Church's thesis; a modern solution to Post's problem; global properties of Turing degrees; and a complete algebraic characterization of many-one degrees. Included are a number of applications to logic (in particular Gödel's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation.

Theories of Computational Complexity

  • 1st Edition
  • Volume 35
  • January 1, 1988
  • C. Calude
  • English
  • eBook
    9 7 8 - 0 - 0 8 - 0 8 6 7 7 5 - 5
This volume presents four machine-independent theories of computational complexity, which have been chosen for their intrinsic importance and practical relevance. The book includes a wealth of results - classical, recent, and others which have not been published before.In developing the mathematics underlying the size, dynamic and structural complexity measures, various connections with mathematical logic, constructive topology, probability and programming theories are established. The facts are presented in detail. Extensive examples are provided, to help clarify notions and constructions. The lists of exercises and problems include routine exercises, interesting results, as well as some open problems.

Linear Dynamical Systems

  • 1st Edition
  • Volume 135
  • March 19, 1987
  • Casti
  • English
  • eBook
    9 7 8 - 0 - 0 8 - 0 9 5 6 4 4 - 2

Algebra, Combinatorics and Logic in Computer Science

  • 1st Edition
  • January 1, 1986
  • J. Demetrovics + 2 more
  • English
  • Hardback
    9 7 8 - 0 - 4 4 4 - 8 7 8 6 9 - 4
These two volumes contain expository papers and short research reports covering the most important theoretical (mainly algebraic and logical) aspects of computer science.

Nonlinear System Theory

  • 1st Edition
  • Volume 175
  • February 21, 1985
  • Casti
  • English
  • eBook
    9 7 8 - 0 - 0 8 - 0 9 5 8 6 5 - 1

Topics in the Theory of Computation

  • 1st Edition
  • Volume 24
  • January 1, 1985
  • M. Karpinski + 1 more
  • English
  • eBook
    9 7 8 - 0 - 0 8 - 0 8 7 2 1 3 - 1
This volume contains nine selected papers presented at the Borgholm conference. They were chosen on the basis of their immediate relevance to the most fundamental aspects of the theory of computation and the newest developments in this area.These papers, which have been extended and refereed, fall into eight categories: 1. Constructive Mathematics in Models of Computation and Programming; 2. Abstract Calculi and Denotational Semantics; 3. Theory of Machines, Computations and Languages; 4. Nondeterminism, Concurrency and Distributed Computing; 5. Abstract Algebras, Logics and Combinatorics in Computation Theory; 6. General Computability and Decidability; 7. Computational and Arithmetic Complexity; 8. Analysis of Algorithms and Feasible Computing.

The Lambda Calculus

  • 2nd Edition
  • Volume 103
  • October 1, 1984
  • H.P. Barendregt
  • English
  • eBook
    9 7 8 - 0 - 0 8 - 0 9 3 3 7 5 - 7
The revised edition contains a new chapter which provides an elegant description of the semantics. The various classes of lambda calculus models are described in a uniform manner. Some didactical improvements have been made to this edition. An example of a simple model is given and then the general theory (of categorical models) is developed. Indications are given of those parts of the book which can be used to form a coherent course.