Search results for "introduction to python programming"
Items we need to order for you
Easy Programming with the TI-99/4A
Welcome to the world of computer programming. Your Texas Instruments TI-99/4A is a real 16-bit microcomputer, complete with sound and color graphics. Making these features do what you want may seem impossible at fIrst, but don't worry; there's nothing mysterious about computer programming. Learning to program computers simply means learning a new language-in this case, TI BASIC (for Beginner's All purpose Symbolic Instruction Code), a version of the most popular language used on today's microcomputers. This book will teach you, step by step, how to tell your machine what you wish it to do-in other words, how to program it. But that's not all. You'll also find chapters on general microcomputer principles, cassette deck use, the TI-99/4A as a terminal for much larger systems, options for expansion, and a list of resources for getting the most out of your home computer. With the 99/4A you have access to a large library of programs, or software, already written by someone else. Without knowing anything about programming, you can use this software to play games, learn math, or store addresses. But at some point you'll want to make your personal computer really personal. You might want to create your own video game or compose a tune. And that's when you'll want to learn programming.
R 1,540.07
R 2,741.92
Introduction to Coding Theory and Algebraic Geometry
These notes are based on lectures given in the semmar on "Coding Theory and Algebraic Geometry" held at Schloss Mickeln, Diisseldorf, November 16-21, 1987. In 1982 Tsfasman, Vladut and Zink, using algebraic geometry and ideas of Goppa, constructed a seqeunce of codes that exceed the Gilbert-Varshamov bound. The result was considered sensational. Furthermore, it was surprising to see these unrelated areas of mathematics collaborating. The aim of this course is to give an introduction to coding theory and to sketch the ideas of algebraic geometry that led to the new result. Finally, a number of applications of these methods of algebraic geometry to coding theory are given. Since this is a new area, there are presently no references where one can find a more extensive treatment of all the material. However, both for algebraic geometry and for coding theory excellent textbooks are available. The combination ofthe two subjects can only be found in a number ofsurvey papers. A book by C. Moreno with a complete treatment of this area is in preparation. We hope that these notes will stimulate further research and collaboration of algebraic geometers and coding theorists. G. van der Geer, J.H.van Lint Introduction to CodingTheory and Algebraic Geometry PartI -- CodingTheory Jacobus H. vanLint 11 1. Finite fields In this chapter we collect (without proof) the facts from the theory of finite fields that we shall need in this course.
R 1,410.25
Introduction to Mathematical Logic
This is a compact mtroduction to some of the pnncipal tOpICS of mathematical logic . In the belief that beginners should be exposed to the most natural and easiest proofs, I have used free-swinging set-theoretic methods. The significance of a demand for constructive proofs can be evaluated only after a certain amount of experience with mathematical logic has been obtained. If we are to be expelled from "Cantor's paradise" (as nonconstructive set theory was called by Hilbert), at least we should know what we are missing. The major changes in this new edition are the following. (1) In Chapter 5, Effective Computability, Turing-computabIlity IS now the central notion, and diagrams (flow-charts) are used to construct Turing machines. There are also treatments of Markov algorithms, Herbrand-Godel-computability, register machines, and random access machines. Recursion theory is gone into a little more deeply, including the s-m-n theorem, the recursion theorem, and Rice's Theorem. (2) The proofs of the Incompleteness Theorems are now based upon the Diagonalization Lemma. Lob's Theorem and its connection with Godel's Second Theorem are also studied. (3) In Chapter 2, Quantification Theory, Henkin's proof of the completeness theorem has been postponed until the reader has gained more experience in proof techniques. The exposition of the proof itself has been improved by breaking it down into smaller pieces and using the notion of a scapegoat theory. There is also an entirely new section on semantic trees.
R 2,015.00
Lipid Biochemistry: An Introduction
In the preface to the Second edition, we made a prediction that many exciting developments would take place in the coming years that would change the face of a new edition. This has indeed been the case and the current edition reflects these new advances. Our picture of the structure of the fatty acid synthetase has changed dramatically, bringing a new concept in enzymology - the multicatalytic polypeptide chain. This new knowledge owes much to the exploitation of genetic mutants, the use of which is undoubtedly going to extend into many other areas of lipid biochemistry. An understanding of the control of lipid metabolism has also advanced considerably during the last decade and we have tried to reflect that here, although it will be some years before a truly integrated picture can be obtained. For this reason we have continued to deal with the control of particular aspects of lipid metabolism - fatty acids, triacylglycerols, lipoprotein- in the specific chapters but we can foresee the time when a chapter on the overall integration of lipid metabolism will be appropriate and feasible. As a particular example, the exciting new concepts of the control of cholesterol metabolism in specific tissues via the interaction of low density lipoproteins with cell surface receptors have been described in Chapter 6.
R 1,640.92
