Table of Contents
Augmented Reality, Virtual Reality and Real Virtuality
Bio-molecular Computing
Computing (Miscellaneous)
Discrete Mathematics and Set Theory
Optical Computing
Programming Languages
Supercomputing
Theory of Computing
Unconventional Computing
Quantum
Computing
Computer Science Resources
@ University of Albany
Bio-molecular
Computing
DNA
Computing: A Primer Ars Technica
DNA basis for new generation of computer August 18, 2003 CNN
DNA
'Motors' for Computer Processing Creates a Stir
August 2002 Lucent Technologies
‘DNA
computer’ cracks code March 15, 2002 Physics Web
Using
'Nature's Toolbox,' a DNA Computer Solves a Complex Problem
March 14, 2002 JPL
Olympus
Unveils DNA Computer February
1, 2002 PCWorld
Water
drop holds a trillion computers Devices with
DNA software may one day be fitted into cells
22 November 2001 Nature
Scientists
build tiny computer from DNA
November
22, 2001 ARN
Scientists
Create RNA Computer
January 14, 2000 Princeton University
Scientists
report advance in DNA computing
January 12, 2000 University of Wisconsin
Biological
computer prototype unveiled June 16, 1999 BBC
Computing
(Miscellaneous)
Things that just don't fit
anywhere else in the current categories.
Feasible
Chaotic Encryption January 3, 2003 Physics News Update
Two
Breakthroughs Achieved in Single-Molecule Transistor Research June 12, 2002 NSF
Controlling
computers by thought February 1999 Personal Computer World
Dataflow
computation or dataflow programming has a different architecture than the
Von Neumann architecture. dataflow programming is best suited for parallel
computing. It is difficult to program parallel computers because they require
multiple threads of execution, global data has to managed in them and
synchronization is very complicated. In the Von Neumann architecture the program
accesses data from memory continuously. In dataflow programming data is not
represented as memory but is a dynamic entity that can be generated once and
then continuously updated. The program is represented as a graph where the nodes
are a set of instructions.
Discrete
Mathematics and Set Theory
Graph
Theory Tutorials University of Tennessee
Set
Theory and Topology Research Group at Budapest, Hungary
Mathematics: Does the proof stack up? July 3, 2003
Nature
Optical
Computing
Although a very interesting
subject, I have but a passing interest in it mostly as on of those emerging
possibilities of the future.
Optical
Computing Group, Colorado State University
Beyond
Silicon: Optical Computing This is an article that I wrote for the the
Nation. It appeared in the August 10, 2002 issue. Prospects for Optical
Computing are discussed.
Rosy glow on
information horizon January 26, 2001Nature
Now, Just A
Blinkin' Picosecond! April 28, 2000 Science @ NASA
Optical
computing research at NASA April 28, 2000 Science @ NASA
Programming
Languages
Resources
A
Gentle Introduction to ML
CPlusPlus
C
Resources on the web
An excellent website
JAVA @ SUN The
Source
for Java
Technology
Programming
Links Page - Long page with many links to a wide
variety of computer programming information
The
Association of Lisp Users
The
BASIC Archives
An easy to learn language for beginners
Compilers and Interpreters
Borland C++
Version 5.5
Lispworks A LISP Interpreter
from XAnalys
Books
Common
Lisp the Language (2nd Edition) Guy L. Steele
LISP Primer Colin
Allen Maneesh Dhagat
Thinking
in C++, volumes 1 & 2 (2nd edition) Bruce Eckel
People
Paul Graham's website
Peter
Norvig's website
Known Programming Languages The
language list maintained by Bill Kinnersley of University of Kansas listed a
total of 2350 programming languages. The Language list available at the
following URL: http://wuarchive.wustl.edu/doc/misc/lang-list.txt
Supercomputing
IBM wins fastest computer
bid November 19, 2002 ZDNet
Temporary
Supercomputer November 12, 2002 The
Scientist
Purdue,
Indiana Create New "Tera-Scale" Supercomputer Grid July 12, 2002 Science
Daily
Supercomputing
Suddenly Sexy
July 8, 2002 Wired
Smaller
slower, supercomputers someday may win the race May 29, 2002 LANL
Japanese
'Computenik' Earth Simulator shatters US supercomputer hegemony April 20,
2002 PrimEur Weekly
|
Supercomputing
in Small Spaces (SSS)
project was started by Dr. Wu-chun (Wu) Feng along with Michael S.
Warren and Eric H. Weigle in September 2001 with a 24-node Bladed
Beowulf cluster. The purpose of this project is to balance performance
and price in the field of Supercomputing.
|
|
Canadian
Internetworked Scientific Supercomputer
Theory of
Computation
An
Introduction to the Theory of Computation Eitan Gurari, Ohio State
University Yes, the whole book.
Fundamentals
of Computing These are notes for a course that Prof. Leonid A. Levin
first taught in the Fall 1986 at UC Berkeley and then at Boston
University.
On
Computable Numbers with an application to the Entscheidunsproblem
Proceedings of the London Mathematical Society, Ser. 2 Vol. 42, No. 1936 – 7,
230 – 265 Alan Turing
Quantum
Computing
Quantum Computing is the
final frontier of computing. The field of Quantum Computing is relatively new,
owing its birth to a lecture by Richard Feynman in 1982. Later in 1985 David
Deutsch of the University of Oxford published the first paper on a universal
Quantum Computer. It would suffice to say that it would take a Classical
computer 10 million billion billion years to factor a 1000 digit number, where
as a quantum computer would take around 20 minutes.
The
Final Frontier of Computing: Quantum Computers This is article that I wrote
for the Orbit Magazine
|
|
NMR
Quantum Computation Project
This is the home page of quantum computation research project, a
collaboration between researchers at Stanford University, U.C. Berkeley,
MIT, and IBM. Our project involves the experimental and
theoretical study of quantum-mechanical systems, and how they can be
utilized to process and store information.
|
Personal Homepages of
people in Quantum Computing
Christof
Zalka's Homepage Los Alamos National Laboratory
Ian
Stewart Imperial College, London
Manny
Knill's Homepage Los Alamos National Laboratory
Peter
Shor's Page The man who found the first practical application of Quantum
Computing IBM Research
William
Wootters' Page Williams University
QCL
(Quantum Computation Language)
No you are not seeing things, this really is a language for Quantum Computers.
According to Bernhard Ömer, "QCL is a high level, architecture independent
programming language for quantum computers, with a syntax derived from classical
procedural languages like C or Pascal. This allows for the complete
implementation and simulation of quantum algorithms (including classical
components) in one consistent formalism."
QDD
: A Quantum Computer Emulation Library QDD is a C++ library for simple sets
of quantum computing constructs within the context of the C++ programming
environment. Also provided is the implementation of Shor's Algorithm!
In the News
Quantum
Communication Between the Stars? 22 May 2003 Space.com
Energy
needs may limit size, ability of Quantum Computers November 20, 2002 University
of Arkansas
Quantum Leaps May
Solve Impossible Problems October
2, 2002 NewsFactor
Quantum
cryptography takes to the skies October 2, 2002 New Scientist
Single
atom memory device stores data September 2, 2002 New Scientist
Coherent
Computing
Making qubit
superpositions in superconductors last longer August 2002 Scientific American
Quantum
net for atom angling July 30, 2002 Nature
Towards
Quantum Memory July 29, 2002 inSight
Silicon
quantum computer A quantum computer might be built
using today's technologies June 19 2002 Nature
Sci-Tech:
Transistors Spin Toward Quantum Computing July 12, 2002 NewsFactor
Network
Spin
doctors create quantum transistor July 8, 2002 ZDNet
Quantum
Computers: One Step Closer
June
18, 2002
NewsFactor Network
Quantum
Leap in Computing
March 23, 2000 Wired News
Dilbert
on quantum computing! A little bit of Humor
Disclaimer: The contents
of this website are Copyright 2002-2003 by Muhammad Aurangzeb Ahmad. All
Rights Reserved.
Send your comments and suggestions to
maa2454@rit.edu
