Lenore Blum
Carnegie Mellon University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Lenore Blum.
SIAM Journal on Computing | 1986
Lenore Blum; Manuel Blum; Michael Shub
Two closely-related pseudo-random sequence generators are presented: The
Information & Computation | 1975
Lenore Blum; Manuel Blum
{1 / P}
international cryptology conference | 1983
Lenore Blum; Manuel Blum; Michael Shub
generator, with input P a prime, outputs the quotient digits obtained on dividing 1 by P. The
technical symposium on computer science education | 2007
Lenore Blum; Thomas J. Cortina
x^2 \bmod N
technical symposium on computer science education | 2008
Orit Hazzan; Judith Gal-Ezer; Lenore Blum
generato...
foundations of computer science | 1988
Lenore Blum; Michael Shub; Steve Smale
Intelligence tests occasionally require the extrapolation of an effective sequence (e.g. 1661, 2552, 3663, …) that is produced by some easily discernible algorithm. In this paper, we investigate the theoretical capabilities and limitations of a computer to infer such sequences. We design Turing machines that in principle are extremely powerful for this purpose and place upper bounds on the capabilities of machines that would do better.
International Journal of Bifurcation and Chaos | 1996
Lenore Blum; Felipe Cucker; Michael Shub; Steve Smale
What do we want from a pseudo-random sequence generator? Ideally, we would like a pseudo-random sequence generator to quickly produce, from short seeds, long sequences (of bits) that appear in every way to be generated by successive flips of a fair coin.
Archive | 1998
Lenore Blum; Felipe Cucker; Michael Shub; Steve Smale
In this paper, we describe a pilot summer workshop (CS4HS) held at Carnegie Mellon University in July 2006 for high school CS teachers to provide compelling material that the teachers can use in their classes to emphasize computational thinking and the many possibilities of computer science. Diversity and broadening participation was explicitly addressed throughout the workshop. We focused on broadening the image of what CS is -- and who computer scientists are -- since the reasons for under-representation in the field are very much the same as the reasons for the huge decline in interest. We describe the design of the workshop along with results from initial surveys and evaluations. Short-term evaluations show that this workshop was successful in changing the perception of CS for these teachers and giving them the impetus to include broader topics in their programming courses for the upcoming school year. Future surveys will track the long-term effect of this workshop.
Frontiers-a Journal of Women Studies | 2005
Lenore Blum; Carol Frieze
This paper presents a model program for high school computer science education. It is based on an analysis of the structure of the Israeli high school computer science curriculum considered to be one of the leading curricula worldwide. The model consists of four key elements as well as interconnections between these elements. It is proposed that such a model be considered and/or adapted when a country wishes to implement a nation-wide program for high school computer science education.
SIAM Journal on Computing | 1986
Lenore Blum; Michael Shub
A model for computation over an arbitrary (ordered) ring R is presented. In this general setting, universal machines, partial recursive functions, and NP-complete problems are obtained. While the theory reflects of classical over Z (e.g. the computable functions are the recursive functions), it also reflects the special mathematical character of the underlying ring R (e.g. complements of Julia sets provide natural examples of recursively enumerable undecidable sets over the reals) and provides a natural setting for studying foundational issues concerning algorithms in numerical analysis.<<ETX>>