"Computable Lower Bounds for Busy Beaver Turing Machines."

Holger Petersen (2006)

> Home

Details and statistics

DOI: 10.1007/978-3-540-33461-3_12

access: closed

type: Part in Book or Collection

metadata version: 2019-03-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - series/sci/Petersen06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/series/sci/Petersen06
Holger Petersen:
Computable Lower Bounds for Busy Beaver Turing Machines. Recent Advances in Formal Languages and Applications 2006: 305-319

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.