• English
    • Norsk
  • English 
    • English
    • Norsk
  • Administration
View Item 
  •   Home
  • Det matematisk-naturvitenskapelige fakultet
  • Institutt for informatikk
  • Institutt for informatikk
  • View Item
  •   Home
  • Det matematisk-naturvitenskapelige fakultet
  • Institutt for informatikk
  • Institutt for informatikk
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

The Semantics and Complexity of Succesor-free Nondeterministic Gödel's T

Mender, Bedeho
Master thesis
View/Open
Mender.pdf (415.2Kb)
Year
2009
Permanent link
http://urn.nb.no/URN:NBN:no-22667

Metadata
Show metadata
Appears in the following Collection
  • Institutt for informatikk [3608]
Abstract
We develop a model for a successor-free nondeterministic

flavour of Gödel’s T, which is built with particular consideration made to keep

it as convenient to compute as possible, while still being adequate. We desire

this convenience since we will use deterministic programs to compute the interpretation

of nondeterministic programs, and from this establish a relationship

between deterministic and nondeterminstic complexity classes.
 
Responsible for this website 
University of Oslo Library


Contact Us 
duo-hjelp@ub.uio.no


Privacy policy
 

 

For students / employeesSubmit master thesisAccess to restricted material

Browse

All of DUOCommunities & CollectionsBy Issue DateAuthorsTitlesThis CollectionBy Issue DateAuthorsTitles

For library staff

Login
RSS Feeds
 
Responsible for this website 
University of Oslo Library


Contact Us 
duo-hjelp@ub.uio.no


Privacy policy