Logarithmic Space in Complexity Theory 🧠

This is an audio version of the Wikipedia Article:
https://en.wikipedia.org/wiki/L_(complexity)


00:00:48 1 Complete problems and logical characterization
00:01:31 2 Related complexity classes
00:02:25 3 Additional properties
00:02:37 4 Other uses
00:04:21 5 See also
00:04:42 6 Notes
00:05:09 7 References
00:05:59 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.7281282437710586
Voice name: en-GB-Wavenet-A


"I cannot teach anybody anything, I can only make them think."
- Socrates


SUMMARY
=======
In computational complexity theory, L (also known as LSPACE or DLOGSPACE) is the complexity class containing decision problems that can be solved by a deterministic Turing machine using a logarithmic amount of writable memory space. Formally, the Turing machine has two tapes, one of which encodes the input and can only be read, whereas the other tape has logarithmic size but can be read as well as written. Logarithmic space is sufficient to hold a constant number of pointers into the input and a logarithmic number of boolean flags, and many basic logspace algorithms use the memory in this way.