Download presentation

Presentation is loading. Please wait.

Published byJaiden Stansberry Modified over 2 years ago

1
Space complexity [AB 4]

2
2 Input/Work/Output TM Output

3
Input tape Output tape Work tape State Input head Work head Output head Configurations (First try) The recorded state of a Turing machine at a specific time How many distinct configurations may a Turing machine that uses s cells have?

4
Input tape Output tape Work tape State Input head Work head Output head Configurations The input stays fixed (Read only tape) The output (or the output tape head) does not affect the next transitions (Right only, write only tape).

5
Work tape State Input head Work head Configurations For a given input string x {0,1} n

6
Space complexity Def: The space complexity of a Turing Machine T on input x is the maximal number of tape cells used throughout the computation.

7
7 Space-Complexity

8
8 Space vs. Time

9
The Configuration graph Vertices – All possible configurations

10
PSPACE EXP

11
Name the Class 11

12
The Strong Church-Turing thesis "A probabilistic Turing machine can efficiently simulate any realistic model of computation.“probabilistic Turing machine

13
New Evidence that Quantum Mechanics is Hard to Simulate on Classical Computers I'll discuss new types of evidence that quantum mechanics is hard to simulate classically -- evidence that's more complexity-theoretic in character than (say) Shor's factoring algorithm, and that also corresponds to experiments that seem easier than building a universal quantum computer. Specifically: (1) I'll show that, by using linear optics (that is, systems of non-interacting bosonic particles), one can generate probability distributions that can't be efficiently sampled by a classical computer, unless P^#P = BPP^NP and hence the polynomial hierarchy collapses. The proof exploits an old observation: that computing the amplitude for n bosons to evolve to a given configuration involves taking the Permanent of an n-by-n matrix. I'll also discuss an extension of this result to samplers that only approximate the boson distribution. (Based on recent joint work with Alex Arkhipov) (2) Time permitting, I'll also discuss new oracle evidence that BQP has capabilities outside the entire polynomial hierarchy. (arXiv:0910.4698)

14
“Can machines Think?” Turing (1950): I PROPOSE to consider the question, 'Can machi The question of whether it is possible for machines to think has a long history, which is firmly entrenched in the distinction between dualist and materialist views of the mind. From the perspective of dualism, the mind is non-physical (or, at the very least, has non-physical properties [6] ) and, therefore, cannot be explained in purely physical terms. The materialist perspective argues that the mind can be explained physically, and thus leaves open the possibility of minds that are artificially produced. [7]dualistmaterialistmindnon-physicalnon-physical properties [6] [7] Are there imaginable digital computers which would do as well as human beings?

15
What are we? Was Alan Turing a computer mistreated by other computers? Will there ever be a computer passing Turing’s test? Can everything in our universe be captured as computation? Is there free choice?

Similar presentations

OK

Complexity 18-1 Complexity Andrei Bulatov Probabilistic Algorithms.

Complexity 18-1 Complexity Andrei Bulatov Probabilistic Algorithms.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on leadership skills free download Ppt on alpha and beta testing Ppt on national stock exchange of india Ppt on domain name system Ppt on different occupations images Ppt on job rotation definition Training ppt on soft skills Ppt on solar energy and its uses Ppt on central limit theorem sample Ppt on walt disney concert hall