old_contents: ## circular primes ##
  
  import timeit
  import collections
  import math
  
  
  start = timeit.default_timer()
  
  def is_prime(x):
      if x == 2:
          return True
      if x % 2 == 0 or x == 1:
          return False
      for i in xrange(3, int(math.sqrt(x)) + 1, 2):
          if x % i == 0:
              return False
      return True
  
  def euler_35():
      total = 0  
      primes = [i for i in range(2, 1000000) if is_prime(i) and 
                not any([v for v in str(i) if int(v) % 2 == 0])]
      primes.append(2)
      for prime in primes:
          circle = collections.deque([int(v) for v in str(prime)])
          for i in range(len(circle)):
              circle.rotate(1)
              num_word = ''.join([str(v) for v in circle])
              if not is_prime(int(num_word)):
                  break
              if i == len(circle) - 1:
                  total += 1
      return total
          
  print "Answer: %s" % euler_35()
  stop = timeit.default_timer()
  print "Time: %f" % (stop - start)    
    
  
new_contents: ## circular primes ##
  
  import timeit
  import math
  
  
  start = timeit.default_timer()
  
  def is_prime(x):
      if x == 2:
          return True
      if x % 2 == 0 or x == 1:
          return False
      for i in xrange(3, int(math.sqrt(x)) + 1, 2):
          if x % i == 0:
              return False
      return True
  
  def euler_35():
      return sum([1 for prime in [j for j in map(str, xrange(2, 1000000)) 
                  if is_prime(int(j)) and not any([v for v in j if 
                  int(v) % 2 == 0])] if all(is_prime(int(''.join(prime[i:] + 
                  prime[:i]))) for i in xrange(1, len(prime)))]) + 1 # add one for two 
          
  print "Answer: %s" % euler_35()
  stop = timeit.default_timer()
  print "Time: %f" % (stop - start)    
    
  
subject: make a oneliner ;)