Talk:Manchester Small-Scale Experimental Machine
From Wikipedia, the free encyclopedia
 |
This article is within the scope of the WikiProject Greater Manchester , a collaborative effort to improve Wikipedia's coverage of Greater Manchester-related articles. In so doing it works and collaborates with its mother project WikiProject UK Geography . If you would like to participate, please visit the project page, where you can join the project and see a list of open tasks. Please also feel free to join in the discussions on the project's talk page. | |
| Start | This article has been rated as Start-Class on the assessment scale. (Add assessment comments) | |
| Top | This article has been rated as top-importance within the Greater Manchester WikiProject. | |
M. Williams, in the reference, gives the information about first running first a simple division program, then the relatively prime program, and then the factor of an integer program. Every other source I've seen (including the website in the external link, computer 50) just mentions the third one, calling it the first stored program to run. It seems logical to me that they would first test just the division routine, wo Williams' description seems reasonable. If that is true, then you could argue that the division routine was actually first. If that is considered too trivial, an arguement could be made that the relatively prime program was about as sophisticated as the largest factor program.
Also, Williams says that the relatively prime program used the division routine. Given the instruction set (mainly a subtraction operation, data moves, branch, and stop), it might make more sense to use the original verison of Euclid's algorithm, which uses subtraction only (instead of division). I wonder if that was done.
Can anyone comment on this? --Bubba73 15:33, 5 Jun 2005 (UTC)
If the division routine ran first, then the division routine was the first program. You can't exclude it on grounds of triviality - if it's a sequence of instructions, it's a program, and if those instructions were executed, then the program ran. You might argue that the coprimeness or factoring programs were the first applications to run, but that's a whole other kettle of fish!
As for the implementation of the coprimality test: a subtraction-based Euclid's algorithm would be simpler to write from scratch, but since they'd written the division routine by that point, i suppose it wasn't that much harder to write a division-based one, and a division-based one will run much faster. That makes the second program another landmark - the first reuse of a software component!
-- Tom Anderson (not a user) 2006-02-05
Contents |
[edit] Trivia
One of my first lectures @ Manchester (1996) was by ( as I recall) Tom Kilburn about the Baby, Mark I and early computers, in it he said that one of the problems they had was that due to the departments location on Oxford Road in manchester and the CRT memory units, whenever a badly maintained moped drove past it scrammbled the memory and crashed the computer. If anyone wants to put this in and/or comfirm/fill in blanks be my guest.--ElvisThePrince 11:15, 15 April 2006 (UTC)
[edit] CRT
The article does not say what CRT means. Billlion 10:43, 10 February 2007 (UTC)
I've clarified this in the 2nd paragraph -- the Williams tube is a type of cathode ray tube (CRT). Greg 12:28, 10 February 2007 (UTC)
[edit] Are those numbers right?
"Then this routine was used in a program to show that 314,159,265 and 217,828,183 are relatively prime".
Hm. Looking at those numbers, the first is int(rnd(pi * 10^7)), and the second would be int(rnd(e * 10^7)) except that the leftmost "1" and the "7" have been transposed. I'm unsure whether the numbers given are correctly quoted, or a typist has fumbled somewhere along the line... would someone mind checking? Kay Dekker 01:28, 20 May 2007 (UTC)
[edit] Potential references
...in addition to those on article page
[edit] Papers
- Functional Structure of the Baby. IEEE Annals of the History of Computing; Jul-Sep2005, Vol. 27 Issue 3, p47-47, 2/3p
- Replicating the Manchester Baby: Motives, Methods, and Messages from the Past. Annals of the History of Computing; Jul-Sep2005, Vol. 27 Issue 3, p44-60, 17p
- The Principle of CRT Storage. IEEE Annals of the History of Computing; Jul-Sep2005, Vol. 27 Issue 3, p45-46, 2p
- The beginnings of the Manchester computer phenomenon: People and influences. IEEE Annals of the History of Computing; 1993, Vol. 15 Issue 3, p9, 8p, 2bw
- 'Baby's' Legacy -- The Early Manchester Mainframes; Burton, C.P. ICL Systems Journal; 1999 Vol. 13 Issue 2.
- The University of Manchester Universal High-Speed Digital Computing Machine; Kilburn, T. Nature; 1949 Vol. 164 Issue 4173, p684-687.
[edit] Books
- Early British Computers; Lavington, S.H.; 1980 : Manchester Univ. Press
- Electrical Engineering at Manchester University -- 125 Years of Achievement; Broadbent, T.E.; 1998 : Manchester School of Eng., Univ. of Manchester. Document Type: Book Citation; (AN
Pit-yacker (talk) 13:35, 19 April 2008 (UTC)
