Content deleted Content added
Citation bot (talk | contribs) Add: s2cid. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_webform 165/3850 |
Wingman4l7 (talk | contribs) →Computing by xeroxing on transparencies: -- added date to ref |
||
Line 76:
===Computing by xeroxing on transparencies===
<!-- remember that "xerox" *is* a trademark, and something of an americanism: the globally-understood equivalent is photocopier, to photocopy, a photocopy -->
This approach uses a photocopier 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 three steps:<ref>{{Citation |title=Computing by xeroxing on transparencies |url=https://www.youtube.com/watch?v=4DeXPB3RU8Y |date=April 21, 2015 |language=en |access-date=2022-08-14}}</ref>
* Firstly all 2<sup>n</sup> possible assignments of ''n'' variables have been generated by performing ''n'' photocopies.
| |||