Revision as of 10:44, 24 June 2025 edit OAbot (talk \| contribs) Bots 643,717 edits m Open access bot: url-access=subscription updated in citation with #oabot. ← Previous edit		Latest revision as of 04:43, 27 August 2025 edit undo Citation bot (talk \| contribs) Bots 5,863,340 edits Removed URL that duplicated identifier. \| Use this bot. Report bugs. \| Suggested by Headbomb \| Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox \| #UCB_webform_linked 16/967
Line 30: === Extended parallel computation thesis === The '''extended parallel computation thesis'''<ref>{{Cite book \|last1=Dymond \|first1=Patrick W. \|last2=Cook \|first2=Stephen A. \|title=21st Annual Symposium on Foundations of Computer Science (SFCS 1980) \|chapter=Hardware complexity and parallel computation \|date=October 1980 ~~\|chapter-url=https://ieeexplore.ieee.org/document/4567837~~ \|pages=360–372 \|doi=10.1109/SFCS.1980.22}}</ref> states that both of these are true: * Turing machine (head reversal, tape space) and PRAM (parallel time, processor count) are simultaneously polynomially related.

Parallel computation thesis: Difference between revisions