|
Authored by: Anonymous on Saturday, May 19 2012 @ 02:44 AM EDT |
It may be
that it wasn't mentioned because the JVM and the example
code don't (need to?)
simulate branching/looping as part of array
initialization
If the code does simulate branching/looping,
then how does the compiler know the branching/looping is going to stop? Surely
they must have solved the halting problem [caveat
lector] which Turing proved impossible; or have they solved "specialised
[specific] halting problem"?[ Reply to This | Parent | # ]
|
|
Authored by: Anonymous on Saturday, May 19 2012 @ 09:49 AM EDT |
Maybe you could learn to differentiate DVM (Dalvik Virtual
Machine) from JVM (Java VM)! :D ....and it's Dalvik bytecode
is the only code that'll run in Dalvik VM.
btw, I think GOOG's lawyers messed up by not forcing Oracle's
attorneys on point with this difference. Android (Dalvik DVM)
is not Java JVM. The same goes for most everyone else in this
court. Switching up JVM for DVM or vice versa, most likely
really kept this Jury confused.... Big Time![ Reply to This | Parent | # ]
|
|
|
|
|