|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 14 of 20 found articles
| Title: |
On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis |
| Author: |
Scedrov, Andre |
| Appeared in: |
Annals of pure and applied logic |
| Paging: | Volume 32 (1986) nr. C pages 7 p. |
| Year: |
1986 |
| Contents: | |
| Publisher: |
Published by Elsevier B.V. |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 14 of 20 found articles
| << previous | next >> |