Computation using s-programs

Please use this identifier to cite or link to this item: https://knowledgecommons.lakeheadu.ca/handle/2453/917

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	Kent, C. F.
dc.contributor.author	Wen, Yandan
dc.date.accessioned	2017-06-05T14:03:45Z
dc.date.available	2017-06-05T14:03:45Z
dc.date.created	1987
dc.date.issued	1987
dc.identifier.uri	http://knowledgecommons.lakeheadu.ca/handle/2453/917
dc.description.abstract	The concepts of S and Sn programs are given by Davis, Weyuker, 1983. Several parts of the complexity theory are carried out directly for S and Sn programs. The concepts of non-deterministic and deterministic computation from S-programs are defined, and deterministic simulation of non-deterministic computation is proved. A universal 5-program for general (non-deterministic) computation is shown to require only one duplicate line label. Complexity results are given for these and other simulations, e.g. Turing Machine by 5-programs and the reverse. Cook's Theorem for Sn programs is proved in full.
dc.language.iso	en_US
dc.subject	Machine theory
dc.subject	Formal languages
dc.title	Computation using s-programs
dc.type	Thesis
etd.degree.name	Master of Science
etd.degree.level	Master
etd.degree.discipline	Mathematical Sciences
etd.degree.grantor	Lakehead University
Appears in Collections:	Retrospective theses

Files in This Item:

File	Description	Size	Format
WenY1987m-1b.pdf		5.33 MB	Adobe PDF	View/Open

DSpace JSPUI