Return to BSD News archive
Newsgroups: comp.os.linux.misc,comp.os.linux.development.system,comp.os.linux.networking,comp.unix.bsd.bsdi.misc,comp.unix.bsd.netbsd.misc,comp.unix.bsd.freebsd.misc Path: euryale.cc.adfa.oz.au!newshost.anu.edu.au!harbinger.cc.monash.edu.au!news.rmit.EDU.AU!news.unimelb.EDU.AU!munnari.OZ.AU!spool.mu.edu!howland.reston.ans.net!newsfeed.internetmci.com!news.mathworks.com!fu-berlin.de!golden-gate.owl.de!uni-paderborn.de!news.rwth-aachen.de!news.rhrz.uni-bonn.de!mpifr-bonn.mpg.de!fs1.mpifr-bonn.mpg.de!souva From: souva@aibn55.astro.uni-bonn.de (Ignatios Souvatzis) Subject: Re: need secure OS to entrust millions to In-Reply-To: dunham@gdl.msu.edu's message of 17 May 1996 21:11:05 -0400 Message-ID: <SOUVA.96May21131705@aibn55.astro.uni-bonn.de> Sender: news@mpifr-bonn.mpg.de Nntp-Posting-Host: aibn55 Reply-To: isouvatzis@astro.uni-bonn.de Organization: Radioastronomisches Institut der Universitaet Bonn, Bonn, FRG References: <4gi6t6$3h9@lace.colorado.edu> <4h7rdd$qeu@park.uvsc.edu> <GUTSCHK.96Mar3112617corpus@uni-muenster.de> <GHSU.96Mar7051927@unstable.nswc.navy.mil> <4ndkav$f2@pixar.com> <m2d9441rrz.fsf@notung.msu.edu> <832362355.544.1@datamodl.demon.co.uk> <m2spcyeqfq.fsf@notung.msu.edu> Date: Tue, 21 May 1996 11:17:05 GMT Lines: 44 Xref: euryale.cc.adfa.oz.au comp.os.linux.misc:105017 comp.os.linux.development.system:24379 comp.os.linux.networking:39207 comp.unix.bsd.bsdi.misc:3791 comp.unix.bsd.netbsd.misc:3648 comp.unix.bsd.freebsd.misc:19771 In article <m2spcyeqfq.fsf@notung.msu.edu> dunham@gdl.msu.edu (Steve Dunham) writes: In article <832362355.544.1@datamodl.demon.co.uk> martin@datamodl.demon.co.uk (Martin Hargreaves) writes: > dunham@gdl.msu.edu (Steve Dunham) wrote: > >In 'Algotithms for Quantum Computation: Discrete Log and Factoring' by > >Peter Shor of AT&T Bell Labs (1994), the author details a > >polynomial-time algorithm that factors numbers into primes. The > >catch? The algorithm runs on a quantum mechanical touring machine, > ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ > Now _that_ would be a cool way to get to work. > >which on convential computers takes exponential time to emulate. > >Physicists are still trying to figure out if and how such a device can > >be built. > > Can I put my order in now, just in case? > :-) I can see it now - Quantum coprocessors. Ah.... I still only have 2 of 8 logical coprocessor slots used [0: internal MMU; 1: FPU] in my Amiga 3000 (68030+68882 @ 25 MHz), could put in 6 of them and run them concurrently, provided I had a knowledgable compiler... (or function library) and I rewrote the scheduler to save their states on context switches. Regards, Ignatios Souvatzis -- NetBSD 1.0 is a release version, Linux 0.9??? still beta. (Matthias Scheler) I doubt that this distinction matters that much for Linux. (Hamish Macdonald)