"On the impossibility of explicit upper bounds on lengths of some provably ..."

Andre Scedrov (1986)

> Home

Details and statistics

DOI: 10.1016/0168-0072(86)90057-6

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/apal/Scedrov86a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/apal/Scedrov86a
Andre Scedrov:
On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis. Ann. Pure Appl. Log. 32: 291-297 (1986)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.