"Higher Types, Finite Domains and Resource-bounded Turing Machines."

Lars Kristiansen (2012)

> Home

Details and statistics

DOI: 10.1093/LOGCOM/EXQ009

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/logcom/Kristiansen12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/logcom/Kristiansen12
Lars Kristiansen:
Higher Types, Finite Domains and Resource-bounded Turing Machines. J. Log. Comput. 22(2): 281-304 (2012)

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.