Re: The languages Perl, Java, C++, and Ruby and interview strategies

Robert A Duff wrote:
Of course, "can do" should be interpreted to mean "can do reasonably
easily" -- otherwise, somebody will point out that everything's like a
Turing machine, and you can write a C++ interpreter in Ada and
vice-versa.

No, I don't think this falls down to a Turing argument if you're talking
about the capabilities of the static type systems. C++ can do arbitrary
computation at compile time. Very few other languages can.

Lisp and ML can both do some interesting things that neither Ada nor C++
can do (easily). And vice-versa.

and OCaml. :-)

--
Dr Jon D Harrop, Flying Frog Consultancy
Objective CAML for Scientists
http://www.ffconsultancy.com/products/ocaml_for_scientists/index.html?usenet
.

Relevant Pages

  • Re: The languages Perl, Java, C++, and Ruby and interview strategies
    ... and you can write a C++ interpreter in Ada and ... If you're interested in what C++ can't do as easily as Ada, ... Ada's protected objects, user-defined numeric types, fixed-point types, ... And vice-versa. ...
    (comp.programming)
  • Re: The languages Perl, Java, C++, and Ruby and interview strategies
    ... Turing machine, and you can write a C++ interpreter in Ada and ... C++ templates are very powerful, but come at a cost: ... Ada generics are much weaker, ... when I said ML I meant to include both SML and OCaml. ...
    (comp.programming)
  • Re: What is the Result from Invoking this Halt Function?
    ... >If we have a countable set of states, we can store the state table on ... >turing machine, just sometimes more convenient to work with). ... >to the tape and then run the interpreter TM (or, ... >each location on the program tape is written no later than just before ...
    (comp.theory)
  • Re: What is the Result from Invoking this Halt Function?
    ... >If we have a countable set of states, we can store the state table on ... >turing machine, just sometimes more convenient to work with). ... >to the tape and then run the interpreter TM (or, ... >each location on the program tape is written no later than just before ...
    (sci.logic)
  • Re: BASIC is still the best programming language!!!
    ... It is possible to implement a Turing machine in BASIC (or at least, ... possible as it is in languages such as Ada, C, Dylan, Erlang, ...
    (comp.programming)