Yes. The design of Python makes it fundamentally difficult to optimize at compile time (i.e., before running the code). It's just not true that Julia is fast BECAUSE OF JEET. Rather, Julia is designed with a type system and multiple dispatch, so the compiler can find out all the necessary details to compile "the same code that you would write in C". This makes it fast: type system. He makes several compromises that allow him, in "type-stable" functions, to fully determine the types of each variable, to know what the type memory layout should be (including parametric types, therefore it Vector{Float64}has a memory layout that is determined by the type and its parameter, which embeds values Float64, such as a NumPy array, except that it generalizes like this,what are your own typesstructget the same efficiency) and compile a version of the code specifically for the types that are visible.
, Python. , , , , , . , , , , , ( . , , , Python). : "", . Python/MATLAB/R , . , "" , Julia, .
, Numba? Numba , , Python, , , . . , Python. , Python , , . , Numba , , . , , . " ", , , , " , , ". .
, , Python - . , Julia Python, .
, . , , ", Python", .
:
http://ucidatascienceinitiative.imtqy.com/IntroToJulia/Html/WhyJulia
http://www.stochasticlifestyle.com/7-julia-gotchas-handle/
http://www.stochasticlifestyle.com/type-dispatch-design-post-object-oriented-programming-julia/