[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Low-level vs. High-level programming (was My First Computer)
- Subject: Re: Low-level vs. High-level programming (was My First Computer)
- From: "Randy McLaughlin" <randy@nospam.com>
- Date: Mon, 23 Jun 2003 23:47:04 -0500
- Newsgroups: comp.sys.cbm, comp.sys.apple2, rec.games.video.classic, comp.os.cpm
- References: <7a1fd8df.0301181540.30e19a40@posting.google.com> <l%1Ia.120$RK2.11917426@newssvr21.news.prodigy.com> <%82Ia.34625$QS4.4604@fe05.atl2.webusene <038073c84e3fe3a00a40ffb3fe9d76b5@TeraNews> <bcvu45$1tjm$1@merope.saaf.se> <9856b2ab0276084facaaa804f3a5f414@TeraNews> <aA4Ja.10576$bH3.2854@fe02.atl2.webusenet.com> <jbeJa.245$3r5.9975866@newssvr15.news.prodigy.com> <wDHJa.1033$lT4.267@fe04.atl2.webusenet.com> <AxJJa.533$Vd7.47369377@newssvr15.news.prodigy.com> <YHJJa.480$XR4.285@fe03.atl2.webusenet.com> <ctLJa.554$R_7.50373791@newssvr15.news.prodigy.com> <vsLJa.2649$QC5.140@fe02.atl2.webusenet.com> <v%MJa.573$my.52230207@newssvr15.news.prodigy.com> <VUPJa.3368$QC5.2609@fe02.atl2.webusenet.com> <LxQJa.639$Yf2.58845238@newssvr15.news.prodigy.com>
- Xref: archiver1.google.com comp.sys.cbm:59239 comp.sys.apple2:31836 rec.games.video.classic:59365 comp.os.cpm:13528
"Kelly Hall" <hall@priest.com> wrote in message
news:LxQJa.639$Yf2.58845238@newssvr15.news.prodigy.com...
>
> "Randy McLaughlin" <randy@nospam.com> wrote in message
> news:VUPJa.3368$QC5.2609@fe02.atl2.webusenet.com...
> > It similar to the chicken and the egg problem but it's not. The Turing
> > engine defines what is required to be a particular type of machine.
That
> is
> > not related to what language it takes to program such a machine. The
main
> > definition it had on programming was that the program was stored (on
tape
> > originally vs. hard-wired contemporaries).
>
> Two problems with what you say:
>
> The concept of Turing machines dates from 1936, before the first digital
> computers were built. They were proposed to explore the meaning of
> computation, which is (to me) the heart of what one uses a 'computer
> programming language' to do.
>
> In a Turing machine, the tape does *not* store the program but only
symbols
> from an arbitrary set of symbols.
>
> http://plato.stanford.edu/entries/turing-machine/
>
> A useful feature of Turing machines is that they are powerful enough to
> describe themselves, leading to a Turing machine that can emulate another
> Turing machine - nested Turing machine, analogous to a CPU ISA emulating a
> second ISA (does P-code or JVM ring a bell?).
>
> Kelly
We are both slightly off target. The Turing machine is still not the
"program" and p-code is not a virtual machine. The virtual machine you are
trying to name is p-system, p-code was the code the virtual machine ran.