Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.lang.forth > #29065

Re: +DO and programming without stack manipulation words

From anton@mips.complang.tuwien.ac.at (Anton Ertl)
Newsgroups comp.lang.forth
Subject Re: +DO and programming without stack manipulation words
Date 2014-03-18 16:50 +0000
Organization Institut fuer Computersprachen, Technische Universitaet Wien
Message-ID <2014Mar18.175032@mips.complang.tuwien.ac.at> (permalink)
References <2014Mar18.144137@mips.complang.tuwien.ac.at> <lg9sbg$6of$1@online.de>

Show all headers | View raw


Bernd Paysan <bernd.paysan@gmx.de> writes:
>Anton Ertl wrote:
>
>> This year I use Forth in the first part of our introductory
>> programming course beginners.  You can find the course notes (in
>> German) on
>> 
>> <http://www.complang.tuwien.ac.at/anton/lvas/pk/>
>
>Nice.  Two comments: Your students probably don't use a Nokia 3210, but a 
>smartphone, and can get Gforth from the Play Store.

There have been several questions about where to get it for MacOS X,
and I could not answer that.  Not sure what the comment about the
Nokia 3210 is about.  The Play Store is about Android smart phones,
right?

>The other comment is about the 10 years: Recent studies have found that this 
>depends on people - this is an average.  It takes on average 10k hours to 
>become a chess master, but it takes talent and on average 14k hours to 
>become a chess grandmaster (and those who become grandmaster get to the 
>master level in just a few k hours).

I think this number comes from the amount of time we have from when we
can start to study a field until our performance lowers because of
age.  That's maybe 20 years in most areas (obviously less for female
gymnasts).  The first things we learn have the most benefit, later the
benefit per learning effort diminishes, so at some point we declare
someone expert (or master or grandmaster).

If we had 5 years until our performance diminishes, people would be
chess grandmasters after maybe 3 years.  If we had 500, maybe after
300; but maybe then the development speed of the field would set the
upper limit of the time for expertise; or maybe the field would
develop slower, because there would be less turnover of experts.

But the comment is mainly aimed at people who have learned Java in
secondary school and now think they know it all.

- anton
-- 
M. Anton Ertl  http://www.complang.tuwien.ac.at/anton/home.html
comp.lang.forth FAQs: http://www.complang.tuwien.ac.at/forth/faq/toc.html
     New standard: http://www.forth200x.org/forth200x.html
   EuroForth 2013: http://www.euroforth.org/ef13/

Back to comp.lang.forth | Previous | NextPrevious in thread | Next in thread | Find similar | Unroll thread


Thread

+DO and programming without stack manipulation words anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2014-03-18 13:41 +0000
  Re: +DO and programming without stack manipulation words Bernd Paysan <bernd.paysan@gmx.de> - 2014-03-18 17:30 +0100
    Re: +DO and programming without stack manipulation words anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2014-03-18 16:50 +0000
      Re: +DO and programming without stack manipulation words Bernd Paysan <bernd.paysan@gmx.de> - 2014-03-18 18:56 +0100
        Re: +DO and programming without stack manipulation words anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2014-03-18 18:25 +0000
          Re: +DO and programming without stack manipulation words Bernd Paysan <bernd.paysan@gmx.de> - 2014-03-18 22:21 +0100
            Re: +DO and programming without stack manipulation words albert@spenarnc.xs4all.nl (Albert van der Horst) - 2014-03-19 11:42 +0000
              Re: +DO and programming without stack manipulation words Bernd Paysan <bernd.paysan@gmx.de> - 2014-03-19 14:59 +0100
                Re: +DO and programming without stack manipulation words Andrew Haley <andrew29@littlepinkcloud.invalid> - 2014-03-20 02:13 -0500
                Re: +DO and programming without stack manipulation words albert@spenarnc.xs4all.nl (Albert van der Horst) - 2014-03-20 12:50 +0000
            Re: +DO and programming without stack manipulation words Alexander Skobelev <al.skobelev@gmail.com> - 2014-03-19 20:47 -0700
            Re: +DO and programming without stack manipulation words Alexander Skobelev <al.skobelev@gmail.com> - 2014-03-19 21:24 -0700
            Re: +DO and programming without stack manipulation words Alexander Skobelev <al.skobelev@gmail.com> - 2014-03-19 23:35 -0700
          Re: +DO and programming without stack manipulation words Mark Wills <markwills1970@gmail.com> - 2014-03-20 01:27 -0700
        Re: +DO and programming without stack manipulation words Paul Rubin <no.email@nospam.invalid> - 2014-03-18 12:24 -0700
    Re: +DO and programming without stack manipulation words albert@spenarnc.xs4all.nl (Albert van der Horst) - 2014-03-18 19:23 +0000
    Re: +DO and programming without stack manipulation words Assad Ebrahim <assad.ebrahim@alum.swarthmore.edu> - 2014-03-19 18:36 +0000
      Re: +DO and programming without stack manipulation words Spam@ControlQ.com - 2014-03-19 17:32 -0400
        Re: +DO and programming without stack manipulation words Bernd Paysan <bernd.paysan@gmx.de> - 2014-03-19 23:48 +0100
      Re: +DO and programming without stack manipulation words Bernd Paysan <bernd.paysan@gmx.de> - 2014-03-19 23:17 +0100
        Re: +DO and programming without stack manipulation words Assad Ebrahim <assad.ebrahim@alum.swarthmore.edu> - 2014-03-20 01:47 +0000
          Re: +DO and programming without stack manipulation words Bernd Paysan <bernd.paysan@gmx.de> - 2014-03-20 23:00 +0100
      Re: +DO and programming without stack manipulation words albert@spenarnc.xs4all.nl (Albert van der Horst) - 2014-03-20 13:00 +0000

csiph-web