More precisely, any Turing complete language.
This is the substance of the first really big theorem about computers, the Halting problem. If the language is general enough to even model something pretty simple, it is possible to give a series of instructions that no amount of analysis can answer even a simple question about.
In reply to Re (tilly) 2: Perverse Unreadable Code
by tilly
in thread Perverse Unreadable Code
by Anonymous Monk
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |