Results 221 to 230 of about 11,243,181 (388)
Algorithmic complexity of recursive and inductive algorithms
Theoretical Computer Science, 2004 AbstractThe main goal of this paper is to compare recursive algorithms such as Turing machines with such super-recursive algorithms as inductive Turing machines. This comparison is made in a general setting of dual complexity measures such as Kolmogorov or algorithmic complexity.
openaire +2 more sources
Finding zeros of a polynomial by the Q-D algorithm [PDF]
, 1965 Peter Henrici, Bruce O. Watkins
openalex +1 more source
Algorithm 290: linear equations, exact solutions [PDF]
, 1966 John C. Boothroyd
openalex +1 more source
Letters to the editor: On practicality of sieving techniques vs. the sieving algorithm [PDF]
, 1968 John E. Howland
openalex +1 more source
Algorithm 102: Permutation in lexicographical order [PDF]
, 1962 G. Schrack, M. Shimrat
openalex +1 more source
Algorithm 13: Evaluation of the Legendre polynomial P n (X) by recursion [PDF]
, 1960 G. M. Galler
openalex +1 more source
Report on the algorithmic language ALGOL 60 [PDF]
, 1960 John Backus +11 more
openalex +1 more source