@article{5581d5a8eea44ceb995e7dc53276f9b0,
title = "An honors course on Alan M. Turing",
author = "Sorenson, {Jonathan P}",
note = "Part of the Lecture Notes in Computer Science book series (LNCS, volume 1838) Let Ψ( x, y) denote the number of integers ≤ x that are composed entirely of primes bounded by y. We present an algorithm for estimating the value of Ψ( x, y) with a running time roughly proportional to \(\sqrt{y}\).",
year = "2005",
month = dec,
day = "1",
doi = "10.1145/1113847.1113887",
language = "American English",
volume = "37",
journal = "SIGCSE Bulletin Inroads",
issn = "0097-8418",
number = "4",
}