✦ LIBER ✦
On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis
✍ Scribed by Andre Scedrov
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 446 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0168-0072
No coin nor oath required. For personal study only.