EXPSPACE | Wikipedia audio article
Channel: wikipedia tts
Date: 2019-05-02

This is an audio version of the Wikipedia Article:
https://en.wikipedia.org/wiki/EXPSPACE


00:03:08 Examples of problems
00:04:26 See also



Listening is a more natural way of learning, when compared to reading. Written language only began at around 3200 BC, but spoken language has existed long ago.

Learning by listening is a great way to:
- increases imagination and understanding
- improves your listening skills
- improves your own spoken accent
- learn while on the move
- reduce eye strain

Now learn the vast amount of general knowledge available on Wikipedia through audio (audio article). You could even learn subconsciously by playing the audio while you are sleeping! If you are planning to listen a lot, you could try using a bone conduction headphone, or a standard speaker instead of an earphone.

Listen on Google Assistant through Extra Audio:
https://assistant.google.com/services/invoke/uid/0000001a130b3f91
Other Wikipedia audio articles at:
https://www.youtube.com/results?search_query=wikipedia+tts
Upload your own Wikipedia articles through:
https://github.com/nodef/wikipedia-tts
Speaking Rate: 0.7809376682998985
Voice name: en-AU-Wavenet-B


"I cannot teach anybody anything, I can only make them think."
- Socrates


SUMMARY
=======
In complexity theory, 'EXPSPACE' is the set of all decision problems solvable by a deterministic Turing machine in 
  
    
      
        O
        (
        
          2
          
            p
            (
            n
            )
          
        
        )
      
    
    {\displaystyle O(2^{p(n)})}
   space, where 
  
    
      
        p
        (
        n
        )
      
    
    {\displaystyle p(n)}
   is a polynomial function of 
  
    
      
        n
      
    
    {\displaystyle n}
  .  (Some authors restrict 
  
    
      
        p
        (
        n
        )
      
    
    {\displaystyle p(n)}
   to be a linear function, but most authors instead call the resulting class ESPACE.) If we use a nondeterministic machine instead, we get the class NEXPSPACE, which is equal to EXPSPACE by Savitch's theorem.
In terms of DSPACE and NSPACE,

  
    
      
        
          
            E
            X
            P
            S
            P
            A
            C
            E
          
        
        =
        
          ⋃
          
            k
            ∈
            
              N
            
          
        
        
          
            D
            S
            P
            A
            C
            E
          
        
        (
        
          2
          
            
              n
              
                k
              
            
          
        
        )
        =
        
          ⋃
          
            k
            ∈
            
              N
            
          
        
        
          
            N
            S
            P
            A
            C
            E
          
        
        (
        
          2
          
            
              n
              
                k
              
            
          
        
        )
      
    
    {\displaystyle {\mathsf {EXPSPACE}}=\bigcup _{k\in \mathbb {N} }{\mathsf {DSPACE}}(2^{n^{k}})=\bigcup _{k\in \mathbb {N} }{\mathsf {NSPACE}}(2^{n^{k}})}
  A decision problem is EXPSPACE-complete if it is in EXPSPACE, and every problem in EXPSPACE has a polynomial-time many-one reduction to it.  In other words, there is a polynomial-time algorithm that transforms instances of one to instances of the other with the same answer.  EXPSPACE-complete problems might be thought of as the hardest problems in EXPSPACE.
EXPSPACE is a strict superset of PSPACE, NP, and P and is believed to be a strict superset of EXPTIME.