



  Cryptanalytic Attacks on RSARSA is the first workable and practicable publickey cryptographic system, based on the use of large prime numbers. It is also the most popular and widelyused 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)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... 



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 HalfCentury of Automata Theory: Celebration and InspirationSuggests 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 610
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 