Proving pearl: Knuth's algorithm for prime numbers
L Théry - International Conference on Theorem Proving in …, 2003 - Springer
Abstract In his book “The Art of Computer Programming”, Donald Knuth gives an algorithm to
compute the first n prime numbers. Surprisingly, proving the correctness of this simple …
compute the first n prime numbers. Surprisingly, proving the correctness of this simple …
[PDF][PDF] Proving Pearl: Knuth's Algorithm for Prime Numbers
L Théry - lim.univ-reunion.fr
In his book “The Art of Computer Programming”, Donald Knuth gives an algorithm to
compute the first n prime numbers. Surprisingly, proving the correctness of this simple …
compute the first n prime numbers. Surprisingly, proving the correctness of this simple …
Proving Pearl: Knuth's Algorithm for Prime Numbers
L Théry - Edited by G. Goos, J. Hartmanis, and J. van Leeuwen - Springer
In his book “The Art of Computer Programming”, Donald Knuth gives an algorithm to
compute the first n prime numbers. Surprisingly, proving the correctness of this simple …
compute the first n prime numbers. Surprisingly, proving the correctness of this simple …
Proving Pearl: Knuth's Algorithm for Prime Numbers
L Théry - Theorem Proving in Higher Order Logics - infona.pl
In his book “The Art of Computer Programming”, Donald Knuth gives an algorithm to
compute the first n prime numbers. Surprisingly, proving the correctness of this simple …
compute the first n prime numbers. Surprisingly, proving the correctness of this simple …
[引用][C] Proving pearl: Knuth's algorithm for prime numbers
L THERY - Lecture notes in computer science, 2003 - pascal-francis.inist.fr
Proving pearl: Knuth's algorithm for prime numbers CNRS Inist Pascal-Francis CNRS
Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …
Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …
Proving Pearl: Knuth's Algorithm for Prime Numbers
L Thery - Theorem Proving in Higher Order Logics: 16th …, 2003 - books.google.com
In his book “The Art of Computer Programming”, Donald Knuth gives an algorithm to
compute the first n prime numbers. Surprisingly, proving the correctness of this simple …
compute the first n prime numbers. Surprisingly, proving the correctness of this simple …
Proving Pearl: Knuth's Algorithm for Prime Numbers
L Théry - Theorem Proving in Higher Order Logics: 16th …, 2003 - books.google.com
In his book “The Art of Computer Programming”, Donald Knuth gives an algorithm to
compute the first n prime numbers. Surprisingly, proving the correctness of this simple …
compute the first n prime numbers. Surprisingly, proving the correctness of this simple …