Re: Release of RosAsm V.2.025a

On Sun, 2 Oct 2005 09:27:02 +0000 (UTC)
Alex McDonald <alex_mcd@xxxxxxxxxxxxxxx> wrote:

:Then your machine and its programming language would have to be Turing
:incomplete.

Strictly speaking, all real machines are Turing-incomplete, since they do
not have infinite storage, although the specific example I have in mind is,
indeed, one which forces finite looping.

My purpose, however was not to suggest that any such machine should
actually be build, but rather to demonstrate that it is not safe to assume
Turing completeness for any given combination of machine architecture and
programming language, let alone the additional constraints imposed by
specific hardware configurations, operating systems, and compilers.

-- Chuck
.

Relevant Pages

  • Re: Exploiting code: The Future
    ... "Turing complete" programming language. ... You have an option to go with a managed service or an enterprise software. ... Download FREE whitepaper on how a managed service can help you: http://www.cenzic.com/news_events/wpappsec.php And, now for a limited time we can do a FREE audit for you to confirm your results from other product. ...
    (Pen-Test)
  • Re: a language is a language
    ... who was asserting that if a particular language isn't turing ... complete then it's not a programming language. ... the definition (C allows for implementation-defined limits on all ... resources that can be much lower than those of the platform the ...
    (comp.programming)
  • Re: Steps beyond "Hello World" program
    ... Postscript is Turing complete modulo memory, as are vi macros) ... if I ask what a good programming language to attack problem X in is, ... Turing complete, and that in practice the things that most people I ...
    (comp.programming)
  • Re: a language is a language
    ... If you insist that "programming language" includes only truly ... you can run any Turing Machine program that terminates in S ... Since the machine can take any input whatsoever, ...
    (comp.programming)