Home | Amazing | Today | Tags | Publishers | Years | Account | Search 
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....
Turing (A Novel about Computation)
Turing (A Novel about Computation)
Our hero is Turing, an interactive tutoring program and namesake (or virtual emanation?) of Alan Turing, World War II code breaker and father of computer science. In this unusual novel, Turing's idiosyncratic version of intellectual history from a computational point of view unfolds in tandem with the story of a love affair involving Ethel, a...
The Turing Test and the Frame Problem: Ai's Mistaken Understanding of Intelligence
The Turing Test and the Frame Problem: Ai's Mistaken Understanding of Intelligence
Part of what it means to be a researcher is to identify what appears to be a relationship that others either have not noticed or have not fully appreciated. Both the Turing test and the frame problem have been significant items of discussion for more than 20 years in the philosophy of artificial intelligence and the philosophy of mind, but there...
Parsing the Turing Test: Philosophical and Methodological Issues in the Quest for the Thinking Computer
Parsing the Turing Test: Philosophical and Methodological Issues in the Quest for the Thinking Computer
Parsing the Turing Test is a landmark exploration of both the philosophical and methodological issues surrounding the search for true artificial intelligence. Will computers and robots ever think and communicate the way humans do? When a computer crosses the threshold into self-consciousness, will it immediately jump into the Internet and create a...
An Introduction to 3D Computer Vision Techniques and Algorithms
An Introduction to 3D Computer Vision Techniques and Algorithms

Computer vision encompasses the construction of integrated vision systems and the application of vision to problems of real-world importance. The process of creating 3D models is still rather difficult, requiring mechanical measurement of the camera positions or manual alignment of partial 3D views of a scene. However using algorithms, it is...

Good Math: A Geek's Guide to the Beauty of Numbers, Logic, and Computation (Pragmatic Programmers)
Good Math: A Geek's Guide to the Beauty of Numbers, Logic, and Computation (Pragmatic Programmers)

Mathematics is beautiful--and it can be fun and exciting as well as practical. Good Math is your guide to some of the most intriguing topics from two thousand years of mathematics: from Egyptian fractions to Turing machines; from the real meaning of numbers to proof trees, group symmetry, and mechanical computation. If you've ever...

New Computational Paradigms: Changing Conceptions of What is Computable
New Computational Paradigms: Changing Conceptions of What is Computable
In recent years, classical computability has expanded beyond its original scope to address issues related to computability and complexity in algebra, analysis, and physics. The deep interconnection between "computation" and "proof" has originated much of the most significant work in constructive mathematics and mathematical...
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...

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...

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
...
Unconventional Computation: 10th International Conference, UC 2011, Turku, Finland, June 6-10
Unconventional Computation: 10th International Conference, UC 2011, Turku, Finland, June 6-10

The 10th International Conference on Unconventional Computation, UC 2011, was organized under the auspices of EATCS and Academia Europaea, by the Department of Mathematics of the University of Turku (Turku, Finland), and the Center for Discrete Mathematics and Theoretical Computer Science (Auckland, New Zealand). The event was held in...

Result Page: 6 5 4 3 2 1 
©2018 LearnIT (support@pdfchm.net) - Privacy Policy