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
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,
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 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...
Mind Design II: Philosophy, Psychology, and Artificial Intelligence "Ming Design II is a welcome update of its predecessor, itself a useful compendium on the philosophy of cognitive science. This new volume retains the intellectual foundations, and some discussions of classical AI built on them, while adding connectionism, situated AI, and dynamic systems theory as extra storeys. Which of these is... 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... Computability: Turing, Gödel, Church, and Beyond
In the 1930s a series of seminal works published by Alan Turing, Kurt Gödel, Alonzo Church, and others established the theoretical basis for computability. This work, advancing precise characterizations of effective, algorithmic computability, was the culmination of intensive investigations into the foundations of mathematics. In the...
|Result Page: 6 5 4 3 2 1 |