|
Education
Web
Viewing 1-1 of 1 total results
 Math for Poets and Drummers
4obvious; it is perhaps easiest to derive from the routine described in his solution to Problem 3 (discussed below). Combinatorial sequence generation is the process of systematically listing structures with a given property. Computer-science guru Donald E. Knuth credits Sanskrit proso...
1
0
4obvious; it is perhaps easiest to derive from the routine described in his solution to Problem 3 (discussed below). Combinatorial sequence generation is the process of systematically listing structures with a given property. Computer-science guru Donald E. Knuth credits Sanskrit prosodists with “the first-ever explicit algorithm for combinatorial sequence generation” [4]. A significant difference between the two writers is that Bhatt’s algorithm is iterative—that is, it gives instructions to get from one
5
0
http://www.sju.edu/~rhall/mathforpoets.pdf#page=5
www.sju.edu/~rhall/mathforpoets.pdf#page=5
4obvious; it is perhaps easiest to derive from the routine described <span class="highlight">in</span> his solution to Problem 3 (discussed below). Combinatorial sequence generation is the process of systematically listing structures with <span class="highlight">a</span> given property. Computer-science guru Donald E. Knuth credits Sanskrit prosodists with “the first-ever explicit <span class="highlight">algorithm</span> for combinatorial sequence generation” [4]. <span class="highlight">A</span> significant difference between the two writers is that Bhatt’s <span class="highlight">algorithm</span> is iterative—that is, it gives instructions to get from one
|
