Home | Amazing | Today | Tags | Publishers | Years | Account | Search 
A Second Course in Formal Languages and Automata Theory
A Second Course in Formal Languages and Automata Theory
Intended for graduate students and advanced undergraduates in computer science, A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually covered in a first course. After a review of basic concepts, the book covers combinatorics on words, regular languages, context-free languages, parsing and...
The Annotated Turing: A Guided Tour Through Alan Turing's Historic Paper on Computability and the Turing Machine
The Annotated Turing: A Guided Tour Through Alan Turing's Historic Paper on Computability and the Turing Machine

Before digital computers ever existed, Alan Turing envisioned their power and versatility...but also proved what computers could never do.

In an extraordinary and ultimately tragic life that unfolded like a novel, Turing helped break the German Enigma code to turn the tide of World War II, later speculated on...

The Anatomy of Programming Languages
The Anatomy of Programming Languages
This comprehensive discussion of the components of a programming language emphasises how a language is built. It covers core concepts including specification, objects, expressions, control and types with discussions of fundamentals, implementations strategies and related semantic issues. The book also focuses on current topics such as modules and...
Computational Prospects Of Infinity - Part I: Tutorials (Lecture Notes)
Computational Prospects Of Infinity - Part I: Tutorials (Lecture Notes)
This volume presents the written versions of the tutorial lectures given at the Workshop on Computational Prospects of Infinity, held from 18 June to 15 August 2005 at the Institute for Mathematical Sciences, National University of Singapore. It consists of articles by four of the leading experts in recursion theory (computability theory) and set...
Handbook of Data Structures and Applications
Handbook of Data Structures and Applications

Handbook of Data Structures and Applications responds to the needs of data structure and algorithm researchers by providing a comprehensive survey of data structures of various types. Divided into seven parts, the text begins with a review of introductory material, followed by a discussion of well-know classes of data structures, Priority...

A History of Mathematics: From Mesopotamia to Modernity
A History of Mathematics: From Mesopotamia to Modernity

A History of Mathematics covers the evolution of mathematics through time and across the major Eastern and Western civilizations. It begins in Babylon, then describes the trials and tribulations of the Greek mathematicians. The important, and often neglected, influence of both Chinese and Islamic mathematics is covered in detail,...

Coders at Work
Coders at Work

Peter Seibel interviews 15 of the most interesting computer programmers alive today in Coders at Work, offering a brand-new companion volume to Apress’s highly acclaimed best-seller Founders at Work by Jessica Livingston. As the words “at work” suggest, Peter Seibel focuses on how his...

The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma
The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma
Alan Turing was one of the most important and influential thinkers of the 20th century. This volume makes his key writings available to a non-specialist readership for the first time. They make fascinating reading both in their own right and for their historic significance: contemporary
computational theory, cognitive science, and artificial
...
Cryptanalytic Attacks on RSA
Cryptanalytic Attacks on RSA
RSA is the first workable and practicable public-key cryptographic system, based on the use of large prime numbers. It is also the most popular and widely-used cryptographic system in today's digital world, for which its three inventors Rivest, Shamir and Adleman received the year 2002 Turing Award, the equivalent Nobel Prize in Computer Science....
Computability Theory: An Introduction to Recursion Theory
Computability Theory: An Introduction to Recursion Theory

The study of the class of computable partial functions (i.e., recursive partial functions) stands at the intersection of three fields: mathematics, theoretical computer science, and philosophy.

Mathematically, computability theory originates from the concept of an algorithm. It leads to a classification of functions according...

Evolvable Systems: From Biology to Hardware: 9th International Conference, ICES 2010, York, UK, September 6-8, 2010, Proceedings
Evolvable Systems: From Biology to Hardware: 9th International Conference, ICES 2010, York, UK, September 6-8, 2010, Proceedings

Biology has inspired electronics from the very beginning: the machines that we now call computers are deeply rooted in biological metaphors. Pioneers such as Alan Turing and John von Neumann openly declared their aim of creating arti?cial machines that could mimic some of the behaviors exhibited by natural organisms. Unfortunately, technology...

A Half-Century of Automata Theory: Celebration and Inspiration
A Half-Century of Automata Theory: Celebration and Inspiration
Suggests Automata Theory may be poised for another period of significant advance, similar to that in the 1960s and 1970s. -- Mathematical Reviews, 2002

This volume gathers lectures by 8 distinguished pioneers of automata theory, including two Turing Award winners. In each contribution, the early developments of
...
Result Page: 6 5 4 3 2 1 
©2020 LearnIT (support@pdfchm.net) - Privacy Policy