FemtoComputing: New Architectural Ideas for Procedural and Evolutionary Computers Whose Components Switch in Femto-Seconds

Abstract

This paper presents some tentative ideas on how future procedural and evolutionary computers might compute, when nanotechnology gives us the possibility to store a bit of information on a single atom. At such tiny scales, switching times are likely to be in femtoseconds, i.e. quadrillionths of a second (Walls, 1994). Since electrical signals travel about 30 cm (a foot) in a nanosecond, a femtosecond will correspond to a millionth of this distance, i.e. a length of about 300 molecules. Traditional computing methodologies, using a centralized memory to store program instructions, and a centralized ALU to perform calculations, will no longer be appropriate, due to the time delays involved in fetching instructions from the program memory to the ALU. In the time this would take, the ALU would have changed its state (switching in femtoseconds). Hence both the program instructions and the means used to execute them, need to be distributed throughout the 3D space of the computational medium, whatever form it takes. This paper discusses new and preliminary architectural ideas on how femto-computers can compute in both a procedural and in an evolutionary style.