2 views

Uploaded by Anonymous s3TzBvwS1

Exercise 4

- Foundations of Mathematics
- CPU Scheduling
- Testrestapi Sample Preview
- Greedy Method
- SL-500-EE5
- Forensics
- All the Mathematics You Missed
- Advanced Encryption Advanced Encryption
- Basic Concepts in Computer Hardware and Software
- Aithmetic Conversions
- 501 Geometry Questions.pdf
- Aritificial Intelligence Cheat Sheet Cheat Sheet
- Exercise 3
- Exercise 2
- Chapter 1
- chapter1.pdf
- L12
- L02_Stack
- Live MS.pdf
- 50 Math, Logic and Word Puzzles - Volume 1[EPUB][GLODLS]

You are on page 1of 1

Lent 2004

Suggested Exercises 4

structible. Show that this is the case by giving, for each one, a description

of an appropriate Turing machine.

Prove that if f and g are constructible functions and f (n) ≥ n, then so are

f (g), f + g, f · g and 2f .

there is a nondeterministic machine M that accepts L and all of whose

computations terminate in time O(f (n)) for all inputs of length n. Give a

detailed argument for this statement, describing how M might be obtained

from a machine accepting L in time f (n).

3. In the lecture, a proof of the Time Hierarchy Theorem was sketched. Give

a similar argument for the following Space Hierarchy Theorem:

language in SP ACE(f (n)·log f (n)) that is not in SP ACE(f (n)).

Hierarchy Theorem from Exercise 3.)

[

SPACE((log n)k ).

k

B ∈ SPACE((log n)k ).

(b) Show that there are no POLYLOGSPACE-complete problems with re-

spect to ≤L . (Hint: use (a) and the space hierarchy theorem).

(c) Which of the following might be true: P ⊆ POLYLOGSPACE, P ⊇

POLYLOGSPACE, P = POLYLOGSPACE?

- Foundations of MathematicsUploaded byAhmad Alhour
- CPU SchedulingUploaded byAnonymous s3TzBvwS1
- Testrestapi Sample PreviewUploaded byMarwa De Hatoum
- Greedy MethodUploaded byAnonymous s3TzBvwS1
- SL-500-EE5Uploaded byutham143
- ForensicsUploaded byzeeshan17
- All the Mathematics You MissedUploaded byfcsardinha
- Advanced Encryption Advanced EncryptionUploaded byAnonymous s3TzBvwS1
- Basic Concepts in Computer Hardware and SoftwareUploaded byJugal Kishore
- Aithmetic ConversionsUploaded byAnonymous s3TzBvwS1
- 501 Geometry Questions.pdfUploaded byAnonymous s3TzBvwS1
- Aritificial Intelligence Cheat Sheet Cheat SheetUploaded byAnonymous s3TzBvwS1
- Exercise 3Uploaded byAnonymous s3TzBvwS1
- Exercise 2Uploaded byAnonymous s3TzBvwS1
- Chapter 1Uploaded byAnonymous s3TzBvwS1
- chapter1.pdfUploaded byAnonymous s3TzBvwS1
- L12Uploaded byAnonymous s3TzBvwS1
- L02_StackUploaded byAnonymous s3TzBvwS1
- Live MS.pdfUploaded byAnonymous s3TzBvwS1
- 50 Math, Logic and Word Puzzles - Volume 1[EPUB][GLODLS]Uploaded bymanikanta
- 06.1 Collision Resistance IntroductionUploaded byAnonymous s3TzBvwS1
- etting up the Forensic Laboratory - Ch3.pdfUploaded byAnonymous s3TzBvwS1
- Mastering Entity FrameworkUploaded byAnonymous s3TzBvwS1
- C#AsyncPM TutorialUploaded byAnonymous s3TzBvwS1
- Test Case TemplateUploaded byArunesh Kumar Singh
- Advanced Stored ProceduresUploaded byOleksiy Kovyrin
- Sans Sec 660.4 - Exploiting Linux for Penetration TestersUploaded byAnonymous s3TzBvwS1
- Tor_Forensics_On_Windows_OS_Mattia_Epifani.pdfUploaded byAnonymous s3TzBvwS1
- MTA_SSG_NetFund_individual_without_cropUploaded byTorque Muliango