985 products were found matching your search for Theoretical Aspects of Computer in 1 shops:

Translated (from French) and developed from notes prepared for a course at the University of Paris VII. Deals with the mathematical background of the application to computer science of aspects of logic (namely the correspondence between propositions and types). Treats both the traditional logic material, and its prospective application to computer science. Annotation copyright Book News, Inc. Portland, Or.

Unread book in perfect condition.

Hardcover; surplus library copy with the usual stampings; reference number affixed to the spine, and bar code on front; light fading and shelf wear to exterior; bumps to the lower corners; otherwise in good condition with clean text and tight binding.

New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

This volume deals with the transosseous external fixation techniques that I have been developing over the course of the past 40 years. During this time, our research in medicine, biology and engineering has led to the evolution of more than 800 unique, highly effective methods of treatment that extend beyond the realm of traumatology and orthopedics. The book features a comprehensive theoretical and clinical description of the biologic laws governing the depen­ dence of the shape-forming processes of bones and joints upon the adequacy of blood supply, as well as a delineation of the effect of tension-stress upon the genesis and growth of tissues. I have in­ cluded our latest data on tissue growth and regeneration during transosseous osteosyntheses. The book summarizes the biomechanical principles of applica­ tion of my apparatus; clinical cases selected from more than 25000 patients illustrate the management of some of the most complex disorders of the locomotor system. New solutions to many therapeutic problems are described. In particular, severe limb trauma with large defects of bone, vessels, nerves and skin can be managed without resort to transplantation. Radical debridement surgery can be followed by a one-step restora­ tion of the missing tissue, thus decreasing the likelihood of a serious wound infection or an amputation.

To show the importance of stochastic processes in the change of gene frequencies, the authors discuss topics ranging from molecular evolution to two-locus problems in terms of diffusion models. Throughout their discussion, they come to grips with one of the most challenging problems in population genetics--the ways in which genetic variability is maintained in Mendelian populations.R.A. Fisher, J.B.S. Haldane, and Sewall Wright, in pioneering works, confirmed the usefulness of mathematical theory in population genetics. The synthesis their work achieved is recognized today as mathematical genetics, that branch of genetics whose aim is to investigate the laws governing the genetic structure of natural populations and, consequently, to clarify the mechanisms of evolution.For the benefit of population geneticists without advanced mathematical training, Professors Kimura and Ohta use verbal description rather than mathematical symbolism wherever practicable. A mathematical appendix is included.

First published in 1986. Routledge is an imprint of Taylor & Francis, an informa company.

The series is a platform for contributions of all kinds to this rapidly developing field. General problems are studied from the perspective of individual languages, language families, language groups, or language samples. Conclusions are the result of a deepened study of empirical data. Special emphasis is given to little-known languages, whose analysis may shed new light on long-standing problems in general linguistics.

To show the importance of stochastic processes in the change of gene frequencies, the authors discuss topics ranging from molecular evolution to two-locus problems in terms of diffusion models. Throughout their discussion, they come to grips with one of the most challenging problems in population genetics--the ways in which genetic variability is maintained in Mendelian populations.R.A. Fisher, J.B.S. Haldane, and Sewall Wright, in pioneering works, confirmed the usefulness of mathematical theory in population genetics. The synthesis their work achieved is recognized today as mathematical genetics, that branch of genetics whose aim is to investigate the laws governing the genetic structure of natural populations and, consequently, to clarify the mechanisms of evolution.For the benefit of population geneticists without advanced mathematical training, Professors Kimura and Ohta use verbal description rather than mathematical symbolism wherever practicable. A mathematical appendix is included.

Comprising a rectangular enclosure bounded by a rampart and ditch, the Roman camp displayed the skills of the Roman military engineers in assessing and deploying human and other resources. This study of Roman camps, forts, fortlets and legionary fortresses examines the logistics and ergonomics of their construction, from surveying the landscape and siting the camp, to calculating its dimensions and the manpower required. Information from ancient sources, such as Polybius, Josephus and Hyginus, is used for some of the calculations and examples from Britain, including the forts along Hadrian's Wall and the Antonine Wall, are cited. The quantity of numbers and tables in this volume should not put you off; it is an accessible and interesting study of how Roman Republican and imperial armies fortified their enclaves in the field.

Comprising a rectangular enclosure bounded by a rampart and ditch, the Roman camp displayed the skills of the Roman military engineers in assessing and deploying human and other resources. This study of Roman camps, forts, fortlets and legionary fortresses examines the logistics and ergonomics of their construction, from surveying the landscape and siting the camp, to calculating its dimensions and the manpower required. Information from ancient sources, such as Polybius, Josephus and Hyginus, is used for some of the calculations and examples from Britain, including the forts along Hadrian's Wall and the Antonine Wall, are cited. The quantity of numbers and tables in this volume should not put you off; it is an accessible and interesting study of how Roman Republican and imperial armies fortified their enclaves in the field.

This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory of certain topological spaces that have proved of use in the modeling of various families of typed lambda calculi considered as core programming languages and as meta-languages for denotational semantics. This theory is now known as Domain Theory, and was founded as a subject by Scott and Plotkin. One of the main concerns is to establish links between mathematical structures and more syntactic approaches to semantics, often referred to as operational semantics, which is also described. This dual approach has the double advantage of motivating computer scientists to do some mathematics and of interesting mathematicians in unfamiliar application areas from computer science.

Book is in Used-VeryGood condition. Pages and cover are clean and intact. Used items may not include supplementary materials such as CDs or access codes. May show signs of minor shelf wear and contain very limited notes and highlighting. 1.1

Personal motivation. The dream of creating artificial devices that reach or outperform human inteUigence is an old one. It is also one of the dreams of my youth, which have never left me. What makes this challenge so interesting? A solution would have enormous implications on our society, and there are reasons to believe that the AI problem can be solved in my expected lifetime. So, it's worth sticking to it for a lifetime, even if it takes 30 years or so to reap the benefits. The AI problem. The science of artificial intelligence (AI) may be defined as the construction of intelligent systems and their analysis. A natural definition of a system is anything that has an input and an output stream. Intelligence is more complicated. It can have many faces like creativity, solving prob­ lems, pattern recognition, classification, learning, induction, deduction, build­ ing analogies, optimization, surviving in an environment, language processing, and knowledge. A formal definition incorporating every aspect of intelligence, however, seems difficult. Most, if not all known facets of intelligence can be formulated as goal driven or, more precisely, as maximizing some utility func­ tion. It is, therefore, sufficient to study goal-driven AI; e. g. the (biological) goal of animals and humans is to survive and spread. The goal of AI systems should be to be useful to humans.

The second edition of the book adds more tricks, arising from fourteen years of work by some of the world’s most prominent researchers. These can substantially improve speed, ease of implementation and accuracy when putting algorithms to work on real problems.

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.

This is the newly revised and expanded edition of the popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The second edition contains material on several new topics, such as randomized algorithms for polygon triangulation, planar point location, 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron. A new "Sources" chapter points to supplemental literature for readers needing more information on any topic. A novel aspect is the inclusion of working C code for many of the algorithms, with discussion of practical implementation issues. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research, making it a useful reference for practitioners at all levels. The code in this new edition is significantly improved from the first edition, and four new routines are included. Java versions for this new edition are also available. All code is accessible from the book's Web site (http://cs.smith.edu/~orourke/) or by anonymous ftp.

This essential companion to Chaitins highly successful The Limits of Mathematics, gives a brilliant historical survey of important work on the foundations of mathematics. The Unknowable is a very readable introduction to Chaitins ideas, and includes software (on the authors website) that will enable users to interact with the authors proofs. "Chaitins new book, The Unknowable, is a welcome addition to his oeuvre. In it he manages to bring his amazingly seminal insights to the attention of a much larger audience His work has deserved such treatment for a long time." JOHN ALLEN PAULOS, AUTHOR OF ONCE UPON A NUMBER

All traditional implementation techniques for functional languages fail to avoid useless repetition of work. They are not "optimal" in their implementation of sharing, often causing a catastrophic, exponential explosion in reduction time. Optimal reduction is an innovative graph reduction technique for functional expressions, introduced by Lamping in 1990, that solves the sharing problem. This work, the first on the subject, is a comprehensive account by two of its leading exponents. Practical implementation aspects are fully covered as are the mathematical underpinnings of the subject. The relationship to the pioneering work of Lévy and to Girard's more recent "Geometry of Interaction" are explored; optimal reduction is thereby revealed as a prime example of how a beautiful mathematical theory can lead to practical benefit. The book is essentially self-contained, requiring no more than basic familiarity with functional languages. It will be welcomed by graduate students and research workers in lambda calculus, functional programming or linear logic.

This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical Computer Science.