OU blog

Personal Blogs

Richard Walker

Does making mistakes help learning?

Visible to anyone in the world
Edited by Richard Walker, Thursday, 10 Dec 2009, 01:50

More specifically there is some recent research to suggest that trying to answer the TMA (say) very quickly without any study of the unit - just jot down the best guess you can come up with - and only afterwards reading the relevant bits of the course may improve retention significantly. See http://www.scientificamerican.com/article.cfm?id=getting-it-wrong&sc=MND_20091029

In fact it seems the effect could apply if we do no more than for example try the SAQ before the related section, or even read the unit introduction, section or unit summary etc. before tackling the body of the unit.

I found this idea intriguing and intuitively appealing, but of course that isn't evidence.

Permalink
Share post
Richard Walker

Which websites to trust

Visible to anyone in the world
Edited by Richard Walker, Thursday, 10 Dec 2009, 01:53

To me deciding whether you should trust something you read on the internet is no different from evaluating a printed source. The only way to do it is for each of us to learn critical skills and apply them ourselves. The responsibility of making a judgement can only ever be partially delegated to traditional authorities.

It might seem that an encyclopedia, for example, will be trustworthy because the articles are written by established experts, and carefully reviewed. True this ensures that in most cases what is published is free from serious factual error. However it will still reflect the particular viewpoint of the author (and the editor), which may be quite partial when deciding what to include, which parts of the topic to emphaise as important, and what the significant areas of future developement are likely to be. From any one article the reader can only ever get a one-sided impression.

In addition, bias has been introduced by the mere act of choosing what topics the encyclpedia has articles on and whch not.

Only by consulting multiple sources and comparing can we form a balanced view, and this process must always involve us taking an active part. No panel of experts can ever be relied on to do it for us.

For these and other reasons I cannot believe that the recent proposal by A.C.Grayling, see

Universities should flag up which websites to trust - science-in-society - 19 January 2009 - New Scientist.URL

could ever achieve what it sets out to do, which is to somehow validate the web, so that learners could be directed only to reliable sites.

 

 

 

 

 

Permalink
Share post
Richard Walker

Plankalcül, an early programming language

Visible to anyone in the world
Edited by Richard Walker, Monday, 14 Dec 2009, 00:29

Plankalkül

The first high-level programming language was Plankalkül, published in 1948 by the German inventor Konrad Zuse.

This language was very advanced for its time and already displayed many of the same structures we see today. Below is a sample program, followed by a working equivalent in JavaScript.

The program is not at all hard to follow. The only somewhat obscure part is in the declarations e.g. V0[:8.0], where the :8.0 seems to be reserving memory space for an integer represented in 8 bits.

<SCRIPT LANGUAGE=JAVASCRIPT>

/* Plankalkul example from Konrad Zuse
Original code:
P1 max3 (V0[:8.0],V1[:8.0],V2[:8.0]) => R0[:8.0]
max(V0[:8.0],V1[:8.0]) => Z1[:8.0]
max(Z1[:8.0],V2[:8.0]) => R0[:8.0]
END
P2 max (V0[:8.0],V1[:8.0]) => R0[:8.0]
V0[:8.0] => Z1[:8.0]
(Z1[:8.0] < V1[:8.0]) -> V1[:8.0] => Z1[:8.0]
Z1[:8.0] => R0[:8.0]
END
See http://en.wikipedia.org/wiki/Plankalkcül

JavaScript equivalent follows
*/

function max3(v0, v1, v2)
{
var z1;
z1 = max(v0, v1);
z1 = max(z1, v2);
return z1;
}

function max(v0, v1)
{
var z1;
z1 = v0;
if (z1 < v1)
{
z1 = v1;
}
return z1;
}

// Try functions out
document.write('The maximum of 2, 3 and 1 is ' + max(2, 3, 1));

</SCRIPT>

 

Permalink
Share post

This blog might contain posts that are only visible to logged-in users, or where only logged-in users can comment. If you have an account on the system, please log in for full access.

Total visits to this blog: 1951190