"Program Size Complexity for Possibly Infinite Computations."

Verónica Becher et al. (2005)

> Home

Details and statistics

DOI: 10.1305/NDJFL/1107220673

access: closed

type: Journal Article

metadata version: 2020-05-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ndjfl/BecherFNP05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ndjfl/BecherFNP05
Verónica Becher, Santiago Figueira, André Nies, Silvana Picchi:
Program Size Complexity for Possibly Infinite Computations. Notre Dame J. Formal Log. 46(1): 51-64 (2005)

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.