Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/1164
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | VERMEULEN, Gijs | - |
dc.date.accessioned | 2007-01-08T08:50:10Z | - |
dc.date.available | 2007-01-08T08:50:10Z | - |
dc.date.issued | 2005 | - |
dc.identifier.uri | http://hdl.handle.net/1942/1164 | - |
dc.format.extent | 458516 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | nl | - |
dc.subject.other | Context vrije talen, pumping lemma, reduceerbaarheid computatie histories, mapping reduceerbaarheid, recursie theorema, turing reduceerbaarheid, PSPACE-compleetheid, TQBF probleem, relativisatie, uniforme booleaanse circuits | - |
dc.title | Berekenbaarheid, onberekenbaarheid en compexiteit: een aanvullende studie | - |
dc.type | Theses and Dissertations | - |
local.format.pages | 61 | - |
local.bibliographicCitation.jcat | T2 | - |
local.type.specified | Master thesis | - |
dc.bibliographicCitation.oldjcat | - | |
item.fullcitation | VERMEULEN, Gijs (2005) Berekenbaarheid, onberekenbaarheid en compexiteit: een aanvullende studie. | - |
item.accessRights | Open Access | - |
item.contributor | VERMEULEN, Gijs | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | Master theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
vermeulen-gijs.PDF | 447.77 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.