"Computer Runtimes and the Length of Proofs - With an Algorithmic ..."

Hector Zenil (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-27654-5_17

access: closed

type: Conference or Workshop Paper

metadata version: 2020-12-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/birthday/Zenil12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/birthday/Zenil12
Hector Zenil:
Computer Runtimes and the Length of Proofs - With an Algorithmic Probabilistic Application to Waiting Times in Automatic Theorem Proving. Computation, Physics and Beyond 2012: 224-240

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.