Interpret the bits of the executable as a discrete-time signal (or alternatively, a base you like) and compute the FFT.
-
-
-
And what is the meaning of the result of such a process?
-
Yeah that’s a good point. Probably gibberish unless there’s some sort of regular pattern going on in the executable. Wonder what would happen if we applied digital filters
End of conversation
New conversation -
-
-
If you Fourier transform the code of an FT program, can that lead to a halting problem paradox?
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Given that programs are traditionally sets of characters, you would have the frequency distribution of each one, followed by frequency of words, sentences and so on. You could evaluate someone's code by the number of "if" "for" etc. Probably see if its declarative vs Imperative
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Instructions? Or sets of instructions? The results represent how heavily your code relies on the particular sets of instructions. If device handles that set of instructions poorly, that piece of code gonna run very slowly on that device.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
I’d guess it’s the actual execution order. The streams of commands across cores.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
I think it is being transformed to “WTF per second” domain.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.