Advertisement
Published in:
2010 | OriginalPaper | Chapter
Using Light to Implement Parallel Boolean Algebra
Author : Tom Head
Published in: Developments in Language Theory
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We design and implement highly parallel algorithms that use light as the tool of computation. An ordinary xerox machine and a box of transparencies constitutes our computer. We find the maximum in a list of
n
-bit numbers of arbitrary length using at most
n
xerox copying steps. We decide, for any graph having
n
vertices and
m
edges, whether a 3-coloring exists in at most 2
n
+ 4
m
copying steps. For large instances of problems such as the 3-color problem, this solution method may require the production of transparencies that display challengingly high densities of information. Our ultimate purpose here is to give hand tested ‘ultra-parallel’ algorithmic procedures that may provide useful suggestions for future optical technologies.