
ilość książek w kategorii: 38275
![]() |
Subrecursive Programming Systems: Complexity & Succinctness
ISBN: 9780817637675 / Angielski / Twarda / 1994 / 253 str. Termin realizacji zamówienia: ok. 22 dni roboczych. 1.1. What This Book is About This book is a study of subrecursive programming systems, efficiency/program-size trade-offs between such systems, and how these systems can serve as tools in complexity theory. Section 1.1 states our basic themes, and Sections 1.2 and 1.3 give a general outline of the book. Our first task is to explain what subrecursive programming systems are and why they are of interest. 1.1.1. Subrecursive Programming Systems A subrecursive programming system is, roughly, a programming language for which the result of running any given program on any given input can be...
1.1. What This Book is About This book is a study of subrecursive programming systems, efficiency/program-size trade-offs between such systems, and ho...
|
cena:
402,53 |
![]() |
Polynomial and Matrix Computations: Fundamental Algorithms
ISBN: 9780817637866 / Angielski / Twarda / 1994 / 416 str. Termin realizacji zamówienia: ok. 22 dni roboczych. Our Subjects and Objectives. This book is about algebraic and symbolic computation and numerical computing (with matrices and polynomials). It greatly extends the study of these topics presented in the celebrated books of the seventies, AHU] and BM] (these topics have been under-represented in CLR], which is a highly successful extension and updating of AHU] otherwise). Compared to AHU] and BM] our volume adds extensive material on parallel com- putations with general matrices and polynomials, on the bit-complexity of arithmetic computations (including some recent techniques of data...
Our Subjects and Objectives. This book is about algebraic and symbolic computation and numerical computing (with matrices and polynomials). It greatly...
|
cena:
603,81 |
![]() |
The Combinatory Programme
ISBN: 9780817638016 / Angielski / Twarda / 1994 / 144 str. Termin realizacji zamówienia: ok. 22 dni roboczych. Combinatory logic started as a programme in the foundation of mathematics and in an historical context at a time when such endeavours attracted the most gifted among the mathematicians. This small volume arose under quite differ ent circumstances, namely within the context of reworking the mathematical foundations of computer science. I have been very lucky in finding gifted students who agreed to work with me and chose, for their Ph. D. theses, subjects that arose from my own attempts 1 to create a coherent mathematical view of these foundations. The result of this collaborative work is...
Combinatory logic started as a programme in the foundation of mathematics and in an historical context at a time when such endeavours attracted the mo...
|
cena:
402,53 |
![]() |
Algol-Like Languages
ISBN: 9780817638801 / Angielski / Twarda / 1996 / 288 str. Termin realizacji zamówienia: ok. 22 dni roboczych. In recent years there has been a remarkable convergence of interest in programming languages based on ALGOL 60. Researchers interested in the theory of procedural and object-oriented languages discovered that ALGOL 60 shows how to add procedures and object classes to simple imperative languages in a general and clean way. And, on the other hand, researchers interested in purely functional languages discovered that ALGOL 60 shows how to add imperative mechanisms to functional languages in a way that does not compromise their desirable properties. Unfortunately, many of the key works in this...
In recent years there has been a remarkable convergence of interest in programming languages based on ALGOL 60. Researchers interested in the theory o...
|
cena:
402,53 |
![]() |
Object-Oriented Programming a Unified Foundation
ISBN: 9780817639051 / Angielski / Twarda / 1997 / 366 str. Termin realizacji zamówienia: ok. 22 dni roboczych. by Luea Cardelli Ever since Strachey's work in the 1960's, polymorphism has been classified into the parametric and overloading varieties. Parametric polymorphism has been the subject of extensive study for over two decades. Overloading, on the other hand, has often been considered too ad hoc to deserve much attention even though it has been, in some form, an ingredient of virtually every programming lan- guage (much more so than parametric polymorphism). With the introduction of object-oriented languages, and in particular with multiple-dispatch object-oriented languages, overloading has...
by Luea Cardelli Ever since Strachey's work in the 1960's, polymorphism has been classified into the parametric and overloading varieties. Parametric ...
|
cena:
402,53 |
![]() |
Elements of Hypermedia Design: Techniques for Navigation & Visualization in Cyberspace
ISBN: 9780817639112 / Angielski / Miękka / 1997 / 400 str. Termin realizacji zamówienia: ok. 22 dni roboczych. The hypermedia authoring process has been vividly described in a special issue of the Economist as a combination of writing a book, a play, a film, and a radio or television show: A hypermedia document combines all these elements and adds some of its own. The author' s first job is to structure and explain all of the infor mation. The author then must distill the information into brief, descriptive nodes. Each node has to contain a Iist of the ingredients, and instructions on how the ingredients are mixed together to the greatest advantage. The structure of the material provided is translated...
The hypermedia authoring process has been vividly described in a special issue of the Economist as a combination of writing a book, a play, a film, an...
|
cena:
201,24 |
![]() |
Comparative Metric Semantics of Programming Languages: Nondeterminism and Recursion
ISBN: 9780817639273 / Angielski / Twarda / 1997 / 220 str. Termin realizacji zamówienia: ok. 22 dni roboczych. During the last three decades several different styles of semantics for program ming languages have been developed. This book compares two of them: the operational and the denotational approach. On the basis of several exam ples we show how to define operational and denotational semantic models for programming languages. Furthermore, we introduce a general technique for comparing various semantic models for a given language. We focus on different degrees of nondeterminism in programming lan guages. Nondeterminism arises naturally in concurrent languages. It is also an important concept in...
During the last three decades several different styles of semantics for program ming languages have been developed. This book compares two of them: th...
|
cena:
402,53 |
![]() |
Algol-Like Languages
ISBN: 9780817639372 / Angielski / Twarda / 1996 / 349 str. Termin realizacji zamówienia: ok. 22 dni roboczych. To construct a compiler for a modern higher-level programming languagel one needs to structure the translation to a machine-like intermediate language in a way that reflects the semantics of the language. little is said about such struc turing in compiler texts that are intended to cover a wide variety of program ming languages. More is said in the Iiterature on semantics-directed compiler construction 1] but here too the viewpoint is very general (though limited to 1 languages with a finite number of syntactic types). On the other handl there is a considerable body of work using the...
To construct a compiler for a modern higher-level programming languagel one needs to structure the translation to a machine-like intermediate language...
|
cena:
402,53 |
![]() |
Neural Networks and Analog Computation: Beyond the Turing Limit
ISBN: 9780817639495 / Angielski / Twarda / 1998 / 181 str. Termin realizacji zamówienia: ok. 22 dni roboczych. The theoretical foundations of Neural Networks and Analog Computation conceptualize neural networks as a particular type of computer consisting of multiple assemblies of basic processors interconnected in an intricate structure. Examining these networks under various resource constraints reveals a continuum of computational devices, several of which coincide with well-known classical models. On a mathematical level, the treatment of neural computations enriches the theory of computation but also explicated the computational complexity associated with biological networks, adaptive... The theoretical foundations of Neural Networks and Analog Computation conceptualize neural networks as a particular type of computer consisting of ... |
cena:
603,81 |
![]() |
Bounded Queries in Recursion Theory
ISBN: 9780817639662 / Angielski / Twarda / 1998 / 353 str. Termin realizacji zamówienia: ok. 22 dni roboczych. One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even...
One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. The natural measure of dif...
|
cena:
402,53 |
![]() |
Modern Software Tools for Scientific Computing
ISBN: 9780817639747 / Angielski / Twarda / 1997 / 380 str. Termin realizacji zamówienia: ok. 22 dni roboczych. Looking back at the years that have passed since the realization of the very first electronic, multi-purpose computers, one observes a tremendous growth in hardware and software performance. Today, researchers and engi- neers have access to computing power and software that can solve numerical problems which are not fully understood in terms of existing mathemati- cal theory. Thus, computational sciences must in many respects be viewed as experimental disciplines. As a consequence, there is a demand for high- quality, flexible software that allows, and even encourages, experimentation with...
Looking back at the years that have passed since the realization of the very first electronic, multi-purpose computers, one observes a tremendous grow...
|
cena:
402,53 |
![]() |
Computer Intensive Methods in Control and Signal Processing: The Curse of Dimensionality
ISBN: 9780817639891 / Angielski / Twarda / 1997 / 303 str. Termin realizacji zamówienia: ok. 22 dni roboczych. Due to the rapid increase in readily available computing power, a corre sponding increase in the complexity of problems being tackled has occurred in the field of systems as a whole. A plethora of new methods which can be used on the problems has also arisen with a constant desire to deal with more and more difficult applications. Unfortunately by increasing the ac curacy in models employed along with the use of appropriate algorithms with related features, the resultant necessary computations can often be of very high dimension. This brings with it a whole new breed of problem which has come...
Due to the rapid increase in readily available computing power, a corre sponding increase in the complexity of problems being tackled has occurred in ...
|
cena:
402,53 |
![]() |
Solving Higher-Order Equations: From Logic to Programming
ISBN: 9780817640323 / Angielski / Twarda / 1997 / 188 str. Termin realizacji zamówienia: ok. 22 dni roboczych. This monograph develops techniques for equational reasoning in higher-order logic. Due to its expressiveness, higher-order logic is used for specification and verification of hardware, software, and mathematics. In these applica tions, higher-order logic provides the necessary level of abstraction for con cise and natural formulations. The main assets of higher-order logic are quan tification over functions or predicates and its abstraction mechanism. These allow one to represent quantification in formulas and other variable-binding constructs. In this book, we focus on equational logic as a...
This monograph develops techniques for equational reasoning in higher-order logic. Due to its expressiveness, higher-order logic is used for specifica...
|
cena:
402,53 |
![]() |
Interpolating Cubic Splines
ISBN: 9780817641009 / Angielski / Twarda / 1999 / 244 str. Termin realizacji zamówienia: ok. 10-14 dni roboczych. The study of spline functions is an outgrowth of basic mathematical concepts arising from calculus, analysis and numerical analysis. Spline modelling affects a number of fields: statistics; computer graphics; CAD programming, and other areas of applied mathematics.
The study of spline functions is an outgrowth of basic mathematical concepts arising from calculus, analysis and numerical analysis. Spline modelling ...
|
cena:
407,16 |
![]() |
An Introduction to Quantum Computing Algorithms
ISBN: 9780817641276 / Angielski / Twarda / 1999 / 140 str. Termin realizacji zamówienia: ok. 22 dni roboczych. In 1994 Peter Shor 65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com puter. Since the difficulty of the factoring problem is crucial for the se curity of a public key encryption system, interest (and funding) in quan tum computing and quantum computation suddenly blossomed. Quan tum computing had arrived. The study of the role of quantum mechanics in the theory of computa tion seems to have begun in the early 1980s with the publications of Paul...
In 1994 Peter Shor 65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently ...
|
cena:
281,76 |
![]() |
Math Into Latex
ISBN: 9780817641313 / Angielski / Miękka / 2000 / 584 str. Termin realizacji zamówienia: ok. 22 dni roboczych. AMS packages that replaced AMS-Ib-TEX, version 1.1, but the book still had an AMS-Ib-TEX-centric view. This third edition is about Ib-TEX. Where necessary, I recommend that you use packages to extend Ib-TEX's capabilities. For typesetting mathematics, I strongly recommend that you use the AMS packages. AMS packages, version 2.0 The American Mathematical Society released version 2.0 ofthe AMS packages in 1999. This third edition covers the changes made in this release. Books The first and second editions of this book dealt primarily with the tasks involved in writing artides. In Part V, the...
AMS packages that replaced AMS-Ib-TEX, version 1.1, but the book still had an AMS-Ib-TEX-centric view. This third edition is about Ib-TEX. Where neces...
|
cena:
362,27 |
![]() |
First Steps in Latex
ISBN: 9780817641320 / Angielski / Miękka / 1999 / 152 str. Termin realizacji zamówienia: ok. 22 dni roboczych. Are you in a hurry? A friend received a letter from the American Mathematical Society (AMS) inform- ing him that his paper had been accepted for publication in the Proceedings of the AMS. If he submitted it as a lt-TEX document, it would be published in 20 weeks- any other format would take almost a year before the appearance in print of the article. The friend had It-T EX installed on his computer on Friday, borrowed the manu- script of this book, and mailed a It-T EX version of his article to the AMS on Monday. First Steps in YI'EX is for the mathematician, physicist, engineer, scientist,...
Are you in a hurry? A friend received a letter from the American Mathematical Society (AMS) inform- ing him that his paper had been accepted for publi...
|
cena:
201,24 |
![]() |
Scheduling and Automatic Parallelization
ISBN: 9780817641498 / Angielski / Twarda / 2000 / 264 str. Termin realizacji zamówienia: ok. 22 dni roboczych. Readership This book is devoted to the study of compiler transformations that are needed to expose the parallelism hiddenin a program. This book is notan introductory book to parallel processing, nor is it an introductory book to parallelizing compilers. Weassume thatreaders are familiar withthebooks High Performance Compilers for Parallel Computingby Wolfe 121] and Super compilers for Parallel and Vector Computers by Zima and Chapman 125], and that they want to know more about scheduling transformations. In this book we describe both task graph scheduling and loop nest scheduling....
Readership This book is devoted to the study of compiler transformations that are needed to expose the parallelism hiddenin a program. This book is no...
|
cena:
402,53 |
![]() |
Automata Theory and its Applications
ISBN: 9780817642075 / Angielski / Twarda / 2001 / 432 str. Termin realizacji zamówienia: ok. 22 dni roboczych. The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one...
The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to repre...
|
cena:
201,24 |
![]() |
An Introduction to Data Structures and Algorithms
ISBN: 9780817642532 / Angielski / Twarda / 2001 / 599 str. Termin realizacji zamówienia: ok. 22 dni roboczych. Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Graphs, Strings, Discrete Fourier Transform, Parallel Computation. Key features: * Complicated concepts are expressed clearly in a single page with minimal notation and without the "clutter" of the syntax of a... Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a ... |
cena:
201,24 |