Michael Stay

Research interests: n-categories, quantum physics, theory of computation, object capabilities, algorithmic information theory, cryptography.

Google Publications

Previous Publications

  •   

    Most Programs Stop Quickly or Never Halt

    Cristian S. Calude, Michael A. Stay

    Advances in Applied Mathematics, vol. 40 (3) (2006), pp. 295-308

  •   

    From Heisenberg to Gödel via Chaitin

    C. S. Calude, M. A. Stay

    International Journal of Theoretical Physics, vol. 44 (7) (2005), pp. 1053-1065

  •   

    Generalized Number Derivatives

    M. Stay

    Journal of Integer Sequences, vol. 8 (2005), Article 05.1.4

  •   

    Natural Halting Probabilities, Partial Randomness, and Zeta Functions

    Cristian S. Calude, Michael A. Stay

    Information and Computing, vol. 204 (11) (2005), pp. 1718-1739

  •   

    Very Simple Chaitin Machines for Concrete AIT

    M. Stay

    Fundamenta Informaticae, vol. 68 (3) (2005), pp. 231-247

  •   

    Inexpensive Linear-Optical Implementation of Deutsch's Algorithm

    M. Stay

    Bulletin of the European Association of Theoretical Computer Science, vol. 84 (2004), pp. 195-202

  •   

    ZIP Attacks with Reduced Known Plaintext

    Michael Stay

    Fast Software Encryption, LNCS 2355, Springer-Verlag (2002), pp. 125-134

  •   

    Improved Cryptanalysis of Rijndael

    Niels Ferguson, John Kelsey, Stefan Lucks, Bruce Schneier, Michael Stay, David Wagner, Doug Whiting

    FSE (2000), pp. 213-230