Skip to main content

Advances in I/O, Speedup, and Universality on Colossus, an Unconventional Computer

  • Conference paper
Unconventional Computation (UC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5715))

Included in the following conference series:

Abstract

Colossus, the first electronic digital (and very unconventional) computer, was not a stored-program general purpose computer in the modern sense, although there are printed claims to the contrary. At least one of these asserts Colossus was a Turing machine. Certainly, an appropriate Turing machine can simulate the operation of Colossus. That is hardly an argument for generality of computation. But this is: a universal Turing machine could have been implemented on a clustering of the ten Colossus machines installed at Bletchley Park, England, by the end of WWII in 1945. Along with the presentation of this result, several improvements in input, output, and speed, within the hardware capability and specification of Colossus are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Andresen, S.L.: Donald Michie: Secrets of Colossus Revealed. IEEE Intelligent Systems, 82–83 (November/December 2001)

    Google Scholar 

  2. Beckman, B.: Codebreakers: Arne Beurling and the Swedish Crypto Program during World War II. American Mathematical Society, Providence (2000)

    MATH  Google Scholar 

  3. Chandler, W.W.: The Installation and Maintenance of Colossus. IEEE Annals Hist. Computing 5, 260–262 (1983)

    Article  Google Scholar 

  4. Coombs, A.W.M.: The Making of Colossus. IEEE Annals Hist. Computing 5, 253–259 (1983)

    Article  Google Scholar 

  5. Copeland, B.J.: Colossus: Its Origins and Originators. IEEE Annals Hist. Computing 26, 38–45 (2004)

    Article  MathSciNet  Google Scholar 

  6. Copeland, B.J.: Personal communication (2005)

    Google Scholar 

  7. Copeland, B.J. (ed.): Colossus: the Secrets of Bletchley Park’s Codebreaking Computers. Oxford University Press, Oxford (2006)

    Google Scholar 

  8. Cragon, H.G.: From Fish to Colossus. Cragon Books, Dallas (2003)

    Google Scholar 

  9. Fant, K., Brandt, S.: Null Convention Logic, a Complete and Consistent Logic for Asynchronous Digital Circuit Synthesis. In: Proceedings of the International Conference on Application Specific Systems, Architectures, and Processors (ASAP 1996), pp. 261–273. IEEE Computer Society Press, Los Alamitos (1996)

    Chapter  Google Scholar 

  10. Flowers, T.H.: The Design of Colossus. IEEE Annals Hist. Computing 5, 239–252 (1983)

    Article  Google Scholar 

  11. Foundations of Mathematics archive (October 2007), http://www.cs.nyu.edu/pipermail/fom/2007-October/thread.html

  12. Fox, B., Webb, J.: Colossal Adventures. New Scientist 154/No.2081, 38–43 (1997)

    Google Scholar 

  13. Gannon, P.: Colossus: Bletchley Park’s Greatest Secret. Atlantic Books, London (2006)

    Google Scholar 

  14. Good, I.J., Michie, D., Timms, G.: General Report on Tunny. National Archives/ Public Records Office, HW 25/4 and HW 25/5 (1945)

    Google Scholar 

  15. Good, I.J.: Early Work on Computers at Bletchley. IEEE Annals Hist. Computing 1, 38–48 (1979)

    Article  Google Scholar 

  16. Good, I.J.: Pioneering Work on Computers at Bletchley. In: Metropolis, N., Howlett, J., Rota, G.-C. (eds.) A History of Computing in the Twentieth Century, pp. 31–46. Academic Press, New York (1980)

    Chapter  Google Scholar 

  17. Herken, R. (ed.): The Universal Turing Machine: A Half-Century Survey, 2nd edn. Springer, New York (1995)

    MATH  Google Scholar 

  18. Hewitt, A.: Universal computation with only 6 rules (2007), http://forum.wolframscience.com/showthread.php?threadid=1432

  19. Sale, T.: Personal communication (2009)

    Google Scholar 

  20. Singh, S.: The Code Book. Anchor Books, New York (1999)

    Google Scholar 

  21. Small, A.W.: The Special Fish Report (1944)

    Google Scholar 

  22. Smith, A.: Universality of Wolfram’s 2, 3 Turing Machine (2008), http://www.wolframscience.com/prizes/tm23/TM23Proof.pdf

  23. Tutte, W.T.: FISH and I. Department of Combinatorics and Optimization monograph 98-39, University of Waterloo (1998)

    Google Scholar 

  24. Watanabe, S.: 5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines. J. ACM 8, 476–483 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  25. Watanabe, S.: 4-Symbol 5-State Universal Turing Machines. Journal of the Information Processing Society of Japan 13, 588–592 (1972)

    Google Scholar 

  26. Wells, B.: Pseudorecursive Varieties and Their Implications for Word Problems. Doctoral dissertation, University of California Berkeley (1982)

    Google Scholar 

  27. Wells, B.: Pseudorecursive Varieties of Semigroups—I. Int. Journal of Algebra and Computation 6, 457–510 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  28. Wells, B.: A Universal Turing Machine Can Run on a Cluster of Colossi. Abstracts Amer. Math. Soc. 25, 441 (2004)

    Google Scholar 

  29. Wells, B.: The PC-User’s Guide to Colossus. Invited chapter on the architecture of Colossus in [7], 116–140 (2006)

    Google Scholar 

  30. Wolfram, S.: A New Kind of Science. Wolfram Media, Champaign (2002)

    MATH  Google Scholar 

  31. Woods, D., Neary, T.: The Complexity of Small Universal Turing Machines: A Survey. Theoretical Computer Science 410, 443–450 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wells, B. (2009). Advances in I/O, Speedup, and Universality on Colossus, an Unconventional Computer. In: Calude, C.S., Costa, J.F., Dershowitz, N., Freire, E., Rozenberg, G. (eds) Unconventional Computation. UC 2009. Lecture Notes in Computer Science, vol 5715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03745-0_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03745-0_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03744-3

  • Online ISBN: 978-3-642-03745-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics