76,075 research outputs found
Can a computer be "pushed" to perform faster-than-light?
We propose to "boost" the speed of communication and computation by immersing
the computing environment into a medium whose index of refraction is smaller
than one, thereby trespassing the speed-of-light barrier.Comment: 7 pages, 1 figure, presented at the UC10 Hypercomputation Workshop
"HyperNet 10" at The University of Tokyo on June 22, 201
A survey on algorithmic aspects of modular decomposition
The modular decomposition is a technique that applies but is not restricted
to graphs. The notion of module naturally appears in the proofs of many graph
theoretical theorems. Computing the modular decomposition tree is an important
preprocessing step to solve a large number of combinatorial optimization
problems. Since the first polynomial time algorithm in the early 70's, the
algorithmic of the modular decomposition has known an important development.
This paper survey the ideas and techniques that arose from this line of
research
Computability and analysis: the legacy of Alan Turing
We discuss the legacy of Alan Turing and his impact on computability and
analysis.Comment: 49 page
- …