Content deleted Content added
Dominic3203 (talk | contribs) No edit summary |
m v2.04b - Bot T20 CW#61 - Fix errors for CW project (Reference before punctuation) |
||
Line 76:
===Computing by xeroxing on transparencies===
This approach uses a Xerox machine and transparent sheets for performing computations.<ref>{{cite conference|last=Head|first=Tom|title= Parallel Computing by Xeroxing on Transparencies|conference= Algorithmic Bioprocesses|date= 2009|pages=631–637|publisher=Springer|doi=10.1007/978-3-540-88869-7_31}}</ref> [[Boolean satisfiability problem#3-satisfiability|k-SAT problem]] with n variables, m clauses and at most k variables per clause has been solved in 3 steps:<ref>{{Citation |title=Computing by xeroxing on transparencies |url=https://www.youtube.com/watch?v=4DeXPB3RU8Y |language=en |access-date=2022-08-14}}</ref>
* Firstly all 2^n possible assignments of n variables have been generated by performing n xerox copies.
| |||