lli0spiyqw

I wonder is there is something similar to the expert system powerloom in python. I hope you get some inspiration from ARIMA (Norvig Book with python code). Also using ontologies with triples in python should be slow for inference.

You are right, since the post say that the performance of 3.11 can be 2x that of 3.10, the implication is that python 3.11 is ten times slower on loop related code than sbcl. Anyway, a 2x improvement is a great feast for python 3.11, congratulations to the team.

The difference in speed is still huge, for example sbcl

  (time (loop for i from 1 below (expt 10 8) by 2 when 
      (zerop (rem i 3) count t)) 

this takes 0.131 seconds

versus python

  import time
  def gato():
    start = time.time()
    s = sum(1 if i % 3 == 0 else 0  for i in       range(1,10\**8,2))
    end = time.time()
    print(s)
    print(end-start)

  gato() 

takes 2.26 seconds, that is 20 times the sbcl version (I am using python 3.10.6)