Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/1164
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVERMEULEN, Gijs-
dc.date.accessioned2007-01-08T08:50:10Z-
dc.date.available2007-01-08T08:50:10Z-
dc.date.issued2005-
dc.identifier.urihttp://hdl.handle.net/1942/1164-
dc.format.extent458516 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isonl-
dc.subject.otherContext vrije talen, pumping lemma, reduceerbaarheid computatie histories, mapping reduceerbaarheid, recursie theorema, turing reduceerbaarheid, PSPACE-compleetheid, TQBF probleem, relativisatie, uniforme booleaanse circuits-
dc.titleBerekenbaarheid, onberekenbaarheid en compexiteit: een aanvullende studie-
dc.typeTheses and Dissertations-
local.format.pages61-
local.bibliographicCitation.jcatT2-
local.type.specifiedMaster thesis-
dc.bibliographicCitation.oldjcat-
item.fullcitationVERMEULEN, Gijs (2005) Berekenbaarheid, onberekenbaarheid en compexiteit: een aanvullende studie.-
item.accessRightsOpen Access-
item.contributorVERMEULEN, Gijs-
item.fulltextWith Fulltext-
Appears in Collections:Master theses
Files in This Item:
File Description SizeFormat 
vermeulen-gijs.PDF447.77 kBAdobe PDFView/Open
Show simple item record

Page view(s)

34
checked on Nov 7, 2023

Download(s)

10
checked on Nov 7, 2023

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.