uts ▁Category : 1 9 7 3 ▁German ▁television ▁series ▁end ings ▁Category : 1 9 7 0 s ▁German ▁television ▁series ▁Category : G erman - language ▁television ▁programs ▁Category : Z DF ▁television ▁series ▁Category : G erman ▁legal ▁television ▁series <0x0A> </s> ▁In ▁computational ▁complexity ▁theory , ▁L ▁( also ▁known ▁as ▁L SP ACE ▁or ▁D LOG SP ACE ) ▁is ▁the ▁complexity ▁class ▁containing ▁decision ▁problems ▁that ▁can ▁be ▁solved ▁by ▁a ▁determin istic ▁T uring ▁machine ▁using ▁a ▁log arith mic ▁amount ▁of ▁writ able ▁memory ▁space . ▁Form ally , ▁the ▁T uring ▁machine ▁has ▁two ▁t apes , ▁one ▁of ▁which ▁enc odes ▁the ▁input ▁and ▁can ▁only ▁be ▁read , ▁whereas ▁the ▁other ▁t ape ▁has ▁log arith mic ▁size ▁but ▁can ▁be ▁read ▁as ▁well ▁as ▁written . ▁Log arith mic ▁space ▁is ▁sufficient ▁to ▁hold ▁a ▁constant ▁number ▁of ▁pointers ▁into ▁the ▁input ▁and ▁a ▁log arith mic ▁number ▁of ▁boolean ▁flags , ▁and ▁many ▁basic ▁log space ▁algorithms ▁use ▁the ▁memory ▁in ▁this ▁way . ▁ ▁Complete ▁problems ▁and ▁logical ▁character ization ▁Every ▁non - t rivial ▁problem ▁in ▁L ▁is ▁complete ▁under ▁log - space ▁redu ctions , ▁so ▁we aker ▁redu ctions ▁are ▁required ▁to ▁identify ▁meaning ful ▁not ions ▁of ▁L - comple ten ess , ▁the ▁most ▁common ▁being ▁first - order ▁redu ctions . ▁ ▁A ▁ 2 0 0 4 ▁result ▁by ▁O mer ▁Re ing old ▁shows ▁that ▁U ST CON , ▁the ▁problem