Search results for "Mathematical Foundations of Computer Science"
Items we need to order for you
Handbook of Mathematical Models for Languages and Computation
The theory of computation is used to address challenges arising in many computer science areas such as artificial intelligence, language processors, compiler writing, information and coding systems, programming language design, computer architecture and more. To grasp topics concerning this theory readers need to familiarize themselves with its computational and language models, based on concepts of discrete mathematics including sets, relations, functions, graphs and logic. This handbook introduces with rigor the important concepts of this kind and uses them to cover the most important mathematical models for languages and computation, such as various classical as well as modern automata and grammars. It explains their use in such crucially significant topics of computation theory as computability, decidability, and computational complexity. The authors pay special attention to the implementation of all these mathematical concepts and models and explains clearly how to encode them in computational practice. All computer programs are written in C#.
R 5,414.00
Language and the Rise of the Algorithm
A wide-ranging history of the algorithm.Bringing together the histories of mathematics, computer science, and linguistic thought, Language and the Rise of the Algorithm reveals how recent developments in artificial intelligence are reopening an issue that troubled mathematicians well before the computer age: How do you draw the line between computational rules and the complexities of making systems comprehensible to people? By attending to this question, we come to see that the modern idea of the algorithm is implicated in a long history of attempts to maintain a disciplinary boundary separating technical knowledge from the languages people speak day to day. Here, Jeffrey M. Binder offers a compelling tour of four visions of universal computation that addressed this issue in very different ways: G. W. Leibniz’s calculus ratiocinator; a universal algebra scheme Nicolas de Condorcet designed during the French Revolution; George Boole’s nineteenth-century logic system; and the early programming language ALGOL, short for algorithmic language. These episodes show that symbolic computation has repeatedly become entangled in debates about the nature of communication. Machine learning, in its increasing dependence on words, erodes the line between technical and everyday language, revealing the urgent stakes underlying this boundary. The idea of the algorithm is a levee holding back the social complexity of language, and it is about to break. This book is about the flood that inspired its construction.
R 1,161.00
Computer Science – Theory and Applications
This book constitutes the proceedings of the 17th International Computer Science Symposium in Russia, CSR 2022, held in St. Petersburg, Russia, June 29-July 3, 2022. The 21 full papers were carefully reviewed and selected from 51 submissions. The papers cover a broad range of topics, such as formal languages and automata theory, geometry and discrete structures; theory and algorithms for application domains and much more.
R 3,329.70
R 912.64
Tour of Computer Science Concepts
A Tour of Computer Science Concepts provides students with a solid foundational knowledge base within the discipline of computer science.The opening chapter offers readers a concise overview of computer history, including the development of computers and the birth of the internet. Additional chapters discuss the differences between analog and digital data, as well as techniques to map one type to another; number base systems; data storage; computer architecture and hardware components; and system software and application software. Students learn about hypertext markup language (HTML) and Cascading Style Sheets (CSS). Fundamental programming concepts, such as variable declaration, assignment statements, user input/output, conditional statements, and loop control structures and functions, are demonstrated through the use of JavaScript. Closing chapters cover computer networks, data transmission between devices, and the increased importance of cybersecurity in modern-day computing. Each chapter features a summary, review of key concepts and terms, and discussion questions to enrich the learning experience.Succinct yet highly informative, A Tour of Computer Science Concepts is an ideal resource for foundational courses in computer science.
R 3,080.31
R 1,442.69
Studies in Computer Science
Samuel D. Conte: Introduction; F. Haas. Computer Science: Past and Future: Worldnet; P.J. Denning. The Origins of Computing and Computer Science at Purdue University; S. Rosen, J.R. Rice. History of the Computer Sciences Department at Purdue University; J.R. Rice, S. Rosen. An Overview of the Carnegie Mellon University Master of Software Engineering Program; N.E. Gibbs. Lessons Learned in Building a Successful Undergraduate Information Systems Academic Program; T.I.M. Ho. Research Contributions: Polynomial Interpolation in Several Variables; C. de Boor. An Exterior Point Algorithm for Linear Programming Implemented on the SX2 Supercomputer; L.D. Pyle, S.H. Kim. Parallel Multilevel Methods; D.M. Young, Jr., B. Vona. Using Algebraic Geometry for Multivariate Hermite Interpolation; C.L. Bajaj. Toward Formalizing Control Systems Simulation Software; J.E. Hollingsworth. On the Sensitivity of Differential Equations; R.V.M. Zahar. 3 additional articles. Index.
R 2,793.65
R 703.94
R 1,117.20
R 611.00
R 4,274.00
Languages of Cooperation and Communication
This Festschrift is dedicated to Erzsébet Csuhaj-Varjú in recognition of her contributions to theoretical computer science. Over the course of her distinguished career, she has played a pivotal role in advancing the fields of formal languages, automata theory, and bioinspired computation. Her work as a research collaborator, mentor, and organizer has been instrumental in fostering a vibrant community, these successes are reflected in the papers contributed to this volume. Prof. Csuhaj-Varjú graduated with a master's degree in mathematics from the Kossuth Lajos University in Debrecen in 1977, she received her PhD in 1993, became a doctor of the Hungarian Academy of Sciences in 2003, and habilitated in computer science from Eötvös Loránd University. From 1979 to 2011 she was a researcher and manager at the Computer and Automation Research Institute of the Hungarian Academy of Sciences, she became a full professor at Eötvös Loránd University in 2008. Prof. Csuhaj-Varjú initiated research directions in the theory and applications of formal languages and automata, unconventional computation, and distributed systems, and played a decisive role in the development of the theory of grammar systems.
R 2,936.00
Domain-theoretic Foundations Of Functional Programming
This textbook provides a basis for a PhD course on domain-theoretic semantics of functional programming languages and their meta-mathematical properties. It introduces basic domain theory and the technique of logical relations as developed by Scott and Plotkin. The solution of recursive domain equations is explained in detail.A complete discussion of the famous full abstraction problem for PCF (a functional Kernel language due to Scott and Plotkin) is given including a construction of the fully abstract Milner model using Kripke logical relations.A final chapter introduces computability in Scott domains and shows that this model is fully abstract and universal for appropriate extensions of PCF by parallel language constructs.
R 1,649.00
R 2,469.00
Quantum Computing for Computer Scientists
The multidisciplinary field of quantum computing strives to exploit some of the uncanny aspects of quantum mechanics to expand our computational horizons. Quantum Computing for Computer Scientists takes readers on a tour of this fascinating area of cutting-edge research. Written in an accessible yet rigorous fashion, this book employs ideas and techniques familiar to every student of computer science. The reader is not expected to have any advanced mathematics or physics background. After presenting the necessary prerequisites, the material is organized to look at different aspects of quantum computing from the specific standpoint of computer science. There are chapters on computer architecture, algorithms, programming languages, theoretical computer science, cryptography, information theory, and hardware. The text has step-by-step examples, more than two hundred exercises with solutions, and programming drills that bring the ideas of quantum computing alive for today's computer science students and researchers.
R 3,727.91
Machine Learning
Machine Learning: Concepts, Techniques and Applications starts at basic conceptual level of explaining machine learning and goes on to explain the basis of machine learning algorithms. The mathematical foundations required are outlined along with their associations to machine learning. The book then goes on to describe important machine learning algorithms along with appropriate use cases. This approach enables the readers to explore the applicability of each algorithm by understanding the differences between them. A comprehensive account of various aspects of ethical machine learning has been discussed. An outline of deep learning models is also included. The use cases, self-assessments, exercises, activities, numerical problems, and projects associated with each chapter aims to concretize the understanding. Features Concepts of Machine learning from basics to algorithms to implementation Comparison of Different Machine Learning Algorithms – When to use them & Why – for Application developers and Researchers Machine Learning from an Application Perspective – General & Machine learning for Healthcare, Education, Business, Engineering Applications Ethics of machine learning including Bias, Fairness, Trust, Responsibility Basics of Deep learning, important deep learning models and applications Plenty of objective questions, Use Cases, Activity and Project based Learning ExercisesThe book aims to make the thinking of applications and problems in terms of machine learning possible for graduate students, researchers and professionals so that they can formulate the problems, prepare data, decide features, select appropriate machine learning algorithms and do appropriate performance evaluation.
R 4,133.82
R 1,289.45
R 913.38
R 733.00
R 580.00
R 4,417.00
R 1,069.00
Handshake Circuits
'Design by programming' has proved very successful in the development of complex software systems. This book describes the construction of programs for VLSI digital circuit design, using the language Tangram, and shows how they can be compiled automatically in fully asynchronous circuits. Handshake circuits were invented by the author to separate questions involving the efficient implementation of the VLSI circuits from issues arising in their design. Dr van Berkel presents a mathematical theory of handshake circuits and a silicon compiler supported by a correctness proof. The treatment of VLSI realizations of handshake circuits includes various forms of optimization, handshake refinement, message encoding, circuit initialization, and testing. The approach is illustrated with a host of examples drawn from a wide range of application areas. The book will be of use to electrical engineers and computer scientists involved in VLSI design.
R 2,976.00
R 1,143.68
R 458.00
Computational Science and Its Applications – ICCSA 2026 Workshops
This nine-volume set LNCS 16758-16766 constitutes the papers of several workshops which were held in conjunction with the 26th International Conference on Computational Science and its Applications, ICCSA 2026, held in Braga, Portugal, during June 30 - July 3, 2026.The 328 full papers, 23 short papers and 3 PhD showcase papers included in these volumes were carefully reviewed and selected from 1184 submissions.The conference consisted of 57 workshops, focusing on topical issues of utmost importance to science, technology and society: from new computational approaches for earth science, to mathematical methods for image processing, new statistical and optimisation methods, several Artificial Intelligence approaches, sustainability issues, smart cities and related technologies.
R 2,240.59
Computer Science Logo Style
This series is for people-adults and teenagers-who are interested in computer programming because it's fun. The three volumes use the Logo programming language as the vehicle for an exploration of computer science from the perspective of symbolic computation and artificial intelligence. Logo is a dialect of Lisp, a language used in the most advanced research projects in computer science, especially in artificial intelligence. Throughout the series, functional programming techniques (including higher order functions and recursion) are emphasized, but traditional sequential programming is also used when appropriate. In the second edition, the first two volumes have been rearranged so that illustrative case studies appear with the techniques they demonstrate. Volume 1 includes a new chapter about higher order functions, and the recursion chapters have been reorganized for greater clarity. Volume 2 includes a new tutorial chapter about macros, an exclusive capability of Berkeley Logo, and two new projects. Throughout the series, the larger program examples have been rewritten for greater readability by more extensive use of data abstraction. In Volume 3 "Beyond Programming", the reader learns that computer science includes not justprogramming computers, but also more formal ways to think about computing, such as automata theory and discrete mathematics. In contrast to most books on those subjects, this volume presents the ideas in the form of concrete, usable computer programs rather than as abstract proofs. Examples include a program to translate from the declarative Regular Expression formalism into the executable Finite State Machine notation, and a Pascal compiler written in Logo. The Logo programs in these books and the author's free Berkeley Logo interpreter are available via the Internet or on diskette.
R 1,660.87
