universality issues in reversible computing systems and
play

Universality Issues in Reversible Computing Systems and Cellular - PowerPoint PPT Presentation

Aug 17, 2023 •439 likes •1.57k views

Universality Issues in Reversible Computing Systems and Cellular Automata Kenichi Morita Hiroshima University Contents 1. Introduction 2. Reversible Turing machines (RTMs) 3. Reversible logic elements and circuits 4. Reversible cellular

  1. Realization of an RE by BBM [Morita, 2008] n ′ n ✻ ✒ ✒ ❄ ❘ I n 1 s 0 ✒ ✒ I ✠ ✛ ✛ ✛ w ′ e ❘ V I I ✲ ✲ ✲ e ′ w ✒ ✠ n 0 ✒ s 1 ❘ I I I I ❘ ✠ w 1 ✒ I ✒ w 0 ❄ ✠ ❘ ✒ I ✠ ✠ ❘ H ✒ ❘ ✠ e 1 ✻ ❘ ✠ ✠ ❘ e 0 ✻ ❘ ✠ ❄ s ′ s

  2. Parallel Case t = 0 t = 1 ❄ ❄ ✻ ✻ ✛ ✛ ✛ ✛ ✻ ✲ ✲ ✲ ✲ ❄ ❄ ✻ ✻

  3. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  4. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  5. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  6. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  7. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  8. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  9. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  10. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  11. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  12. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  13. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  14. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  15. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  16. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  17. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  18. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  19. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  20. Movements of Balls (State: V , Input: s ) n ′ n ✻ ✛ w e V ✲ w ′ e ′ ❄ s ′ s

  21. Orthogonal Case t = 0 t = 1 ❄ ❄ ✻ ✻ ✛ ✛ ✛ ✛ ✛ ✲ ✲ ✲ ✲ ✲ ❄ ❄ ✻ ✻

  22. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ H ✻ ❘ ✠ ✠ ❄ s ′ s

  23. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ H ✻ ❘ ✠ ✠ ❄ s ′ s

  24. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ H ✻ ❘ ✠ ✠ ❄ s ′ s

  25. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ H ✻ ❘ ✠ ✠ ❄ s ′ s

  26. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ H ✻ ❘ ✠ ✠ ❄ s ′ s

  27. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ H ✻ ❘ ✠ ✠ ❄ s ′ s

  28. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  29. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  30. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  31. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  32. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  33. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  34. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  35. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  36. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  37. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  38. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  39. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  40. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  41. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  42. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  43. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  44. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  45. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  46. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  47. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ V ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  48. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ V ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  49. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ V ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  50. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ V ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  51. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ V ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  52. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ V ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  53. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ V ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  54. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ V ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  55. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ V ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  56. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ V ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  57. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ V ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  58. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ V ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  59. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ V ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  60. Movements of Balls (State: H , Input: s ) n ′ n ✻ s 0 ✒ ✛ w e ❘ V ✲ ✲ w ′ e ′ ✒ s 1 I I I ✒ ✻ ❘ ✠ ✠ ❄ s ′ s

  61. 3. Reversible Cellular Automata

  62. Reversible Cellular Automata (RCAs) • It is a CA whose global function is one-to-one. • A kind of spatio-temporal model of a physically reversible space. • In spite of the strong restriction of reversibility, they have rich ability of computing. – Computation-universality – Self-reproduction – Synchronization – etc.

  63. Partitioned Cellular Automata • 1D Partitioned CA (PCA) L C R L C R L C R t � �� � f ❄ � �� � t + 1 i − 1 i + 1 i A local function f of a 1D PCA. • We can design RCAs easily using PCAs.

  64. Universal Reversible CAs — 1D Case — • On infinite configurations: 24-state RPCA [Morita, 2008] • On finite configurations: 98-state RPCA [Morita, 2007] cf. 1D Universal Irreversible CAs: • On infinite configurations: 2-state CA (ECA of rule 110) [Cook, 2004] • On finite configurations: 7-state CA (a modified model) [Lindgren et al., 1990]

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Universality in the equilibration of Universality in the equilibration of isolated systems after

Universality in the equilibration of Universality in the equilibration of isolated systems after

Universality in the equilibration of Universality in the equilibration of isolated systems after a small quench isolated systems after a small quench Lorenzo Campos Venuti University of Southern California, Los Angeles Paolo Zanardi (USC)

222 views • 18 slides
Universality M. Hairer University of Warwick New fellows seminar Universality Experimental /

Universality M. Hairer University of Warwick New fellows seminar Universality Experimental /

Universality M. Hairer University of Warwick New fellows seminar Universality Experimental / numerical fact: large-scale behaviour of systems displaying random behaviour self-similar and independent of microscopic description. Universality

731 views • 19 slides
Electric network for non-reversible Markov chains joint with Aron Folly M arton Bal

Electric network for non-reversible Markov chains joint with Aron Folly M arton Bal

Reversible Irreversible Properties Electric network for non-reversible Markov chains joint with Aron Folly M arton Bal azs University of Bristol School and Workshop on Random Interacting Systems Bath, June 2014. Reversible

699 views • 42 slides
For Quantum and Reversible From Interval . . . Computing, Intervals Are Case of Fuzzy

For Quantum and Reversible From Interval . . . Computing, Intervals Are Case of Fuzzy

Need for Quantum . . . Need for Reversible . . . Need to Take . . . When Is This Data . . . For Quantum and Reversible From Interval . . . Computing, Intervals Are Case of Fuzzy Uncertainty Intervals are Ubiquitous More Appropriate Than A

446 views • 29 slides
the logic of reversible computing Theory and Practice Robin Kaarsgaard February 26, 2018 DIKU,

the logic of reversible computing Theory and Practice Robin Kaarsgaard February 26, 2018 DIKU,

the logic of reversible computing Theory and Practice Robin Kaarsgaard February 26, 2018 DIKU, Department of Computer Science, University of Copenhagen robin@di.ku.dk http://www.di.ku.dk/~robin a human perspective on a phd project We tend to

588 views • 41 slides
Circuit Relations for Real Stabilizers: Towards TOF + H Cole Comfort University of Calgary May

Circuit Relations for Real Stabilizers: Towards TOF + H Cole Comfort University of Calgary May

Graphical calculi for circuits Classical reversible computing Quantum computing Classical reversible and quantum computing Circuit Relations for Real Stabilizers: Towards TOF + H Cole Comfort University of Calgary May 23, 2019 1/26 Cole

438 views • 26 slides
Reversible Computation and Reversible Programming Languages Tetsuo Yokoyama Graduate School of

Reversible Computation and Reversible Programming Languages Tetsuo Yokoyama Graduate School of

Invited Tutorial at RC 2009 Reversible Computation and Reversible Programming Languages Tetsuo Yokoyama Graduate School of Information Science Nagoya University 1 Example: Fibonacci-Pairs global store (three integer variables, initially

513 views • 23 slides
Reproducibility, trust, and proof checking From Universality of Facts to Universality of Proofs

Reproducibility, trust, and proof checking From Universality of Facts to Universality of Proofs

Reproducibility, trust, and proof checking From Universality of Facts to Universality of Proofs Dale Miller Inria Saclay & LIX, Ecole Polytechnique Palaiseau, France 18 October 2016 Reference:Communicating and trusting proofs: The

165 views • 13 slides
Rethinking Power, Resilience, and Sustainability Issues for Large-scale Computing and Storage

Rethinking Power, Resilience, and Sustainability Issues for Large-scale Computing and Storage

Rethinking Power, Resilience, and Sustainability Issues for Large-scale Computing and Storage Systems Data-intensive applications Devesh Tiwari Actionable analytical tools, Assistant Professor runtime systems and libraries, Northeastern

305 views • 6 slides
Speed limits on and shortcuts to reversible computing Sebastian Deffner Department of Physics

Speed limits on and shortcuts to reversible computing Sebastian Deffner Department of Physics

Speed limits on and shortcuts to reversible computing Sebastian Deffner Department of Physics University of Maryland, Baltimore County Sebastian Deffner Speed limits and shortcuts 1 / 5 Mitigating computational errors What is the problem:

209 views • 5 slides
Toward a Curry-Howard Correspondence for Linear, Reversible Computation Reversible Computation

Toward a Curry-Howard Correspondence for Linear, Reversible Computation Reversible Computation

Toward a Curry-Howard Correspondence for Linear, Reversible Computation Reversible Computation 2020 Kostia Chardonnet 1 , 2 Alexis Saurin 2 Benot Valiron 1 1 Universit Paris Saclay 2 Universit de Paris Classical vs Quantum Control Known :

638 views • 48 slides
Towards Reversible De-Identification in Video Sequences Using 3D Avatars and Steganography Karla

Towards Reversible De-Identification in Video Sequences Using 3D Avatars and Steganography Karla

6th COST Action IC1206 Meeting, WG2 Towards Reversible De-Identification in Video Sequences Using 3D Avatars and Steganography Karla Brki University of Zagreb Faculty of Electrical Engineering and Computing HR-10000 Zagreb, Croatia

204 views • 18 slides
Digital Circuits and Systems Universality, Rearranging Truth Tables Shankar Balachandran*

Digital Circuits and Systems Universality, Rearranging Truth Tables Shankar Balachandran*

Spring 2015 Week 2 Module 7 Digital Circuits and Systems Universality, Rearranging Truth Tables Shankar Balachandran* Associate Professor, CSE Department Indian Institute of Technology Madras *Currently a Visiting Professor at IIT Bombay

484 views • 14 slides
Reversible calculus Ioana Cristescu 22 June 2012 Ioana Cristescu Reversible calculus

Reversible calculus Ioana Cristescu 22 June 2012 Ioana Cristescu Reversible calculus

Reversible calculus Ioana Cristescu 22 June 2012 Ioana Cristescu Reversible calculus Internship at PPS Paris Diderot under the supervision of Jean Krivine and Daniele Varacca part of the ANR project on reversibility Reversibility in

710 views • 39 slides
Universality of step bunching behavior in systems with non-conserved dynamics Joachim Krug

Universality of step bunching behavior in systems with non-conserved dynamics Joachim Krug

Universality of step bunching behavior in systems with non-conserved dynamics Joachim Krug Institute for Theoretical Physics, University of Cologne Electromigration-induced step bunching on Si(111) [Yang, Fu & Williams 1996] M. Ivanov, JK,

718 views • 26 slides
Probing lepton flavour universality in B (0) K (0 ) + decays at CMS

Probing lepton flavour universality in B (0) K (0 ) + decays at CMS

Probing lepton flavour universality in B (0) K (0 ) + decays at CMS Author: Julia-Suzana Dancu Supervisor: Dr Oliver Buchm uller Post-doc: Dr Matthias Komm 1/11 Lepton Universality Tests at CMS February 28, 2019

580 views • 19 slides
Executability Hierarchy of RTMs with Infinite Alphabets Bas Luttik Fei Yang November 17, 2016

Executability Hierarchy of RTMs with Infinite Alphabets Bas Luttik Fei Yang November 17, 2016

Executability Hierarchy of RTMs with Infinite Alphabets Bas Luttik Fei Yang November 17, 2016 Where innovation starts Outline 2/25 Finite Version of the Theory of Executability Infinitary Reactive Turing Machines RTM with Atoms

2.77k views • 52 slides
A BAD DREAM: SUBVERTING TRUSTED PLATFORM MODULE WHILE YOU ARE SLEEPING Seunghun Han, Wook Shin,

A BAD DREAM: SUBVERTING TRUSTED PLATFORM MODULE WHILE YOU ARE SLEEPING Seunghun Han, Wook Shin,

A BAD DREAM: SUBVERTING TRUSTED PLATFORM MODULE WHILE YOU ARE SLEEPING Seunghun Han, Wook Shin, Jun-Hyeok Park, and HyoungChun Kim, National Security Research Institute BACKGROUND Trusted Computing Group (TCG) Trusted Platform Module

375 views • 19 slides
an and Education for In Industry The SENAI CIMATEC Campus Highlights 4 buildings More than

an and Education for In Industry The SENAI CIMATEC Campus Highlights 4 buildings More than

UNIT Technology, In Innovation an and Education for In Industry The SENAI CIMATEC Campus Highlights 4 buildings More than 35,000 m Over US$200 million of investment 42 competence areas More than 800 employee SENAI CIMATEC

510 views • 25 slides
Involutory Turing Machines Keisuke Nakano RIEC, Tohoku University RC 2020 @ Online Involution f

Involutory Turing Machines Keisuke Nakano RIEC, Tohoku University RC 2020 @ Online Involution f

Involutory Turing Machines Keisuke Nakano RIEC, Tohoku University RC 2020 @ Online Involution f x dom ( f ). f ( f (x) ) = x Involution (a.k.a. involutory function) A function that is own inverse I.e., f(x) = y if and only if f(y)

1.21k views • 18 slides
Deal Activity - - 2006 2006 7,000 $80,000 Deal Activity $70,000 6,000 $60,000 5,000

Deal Activity - - 2006 2006 7,000 $80,000 Deal Activity $70,000 6,000 $60,000 5,000

2007 Multifamily Market: Review and Assessment Aubrey L. Layne, Jr. President Great Atlantic Management GREAT ATLANTIC Deal Activity and Headlines Economic and Operating Environment Outlook HR Apartment Deal Volume and Price

540 views • 4 slides
Parametric Polymorphism and Abstract Models of Storage (In memory of Christopher Strachey,

Parametric Polymorphism and Abstract Models of Storage (In memory of Christopher Strachey,

Parametric Polymorphism and Abstract Models of Storage (In memory of Christopher Strachey, 1916-1975) Uday S. Reddy 1 1 University of Birmingham Strachey-100, Oxford My introduction to Stracheys ideas Section 1 Introducing the terms

530 views • 40 slides
Probabilistic Computation Lecture 12 Flipping coins, taking chances PP, BPP 1 Probabilistic

Probabilistic Computation Lecture 12 Flipping coins, taking chances PP, BPP 1 Probabilistic

Probabilistic Computation Lecture 12 Flipping coins, taking chances PP, BPP 1 Probabilistic Computation 2 Probabilistic Computation Output depends not only on x, but also on random coin flips 2 Probabilistic Computation Output

1.84k views • 129 slides
Accurate and Stable Empirical CPU Power Modelling for Multi- and Many-Core Systems Matthew J.

Accurate and Stable Empirical CPU Power Modelling for Multi- and Many-Core Systems Matthew J.

Accurate and Stable Empirical CPU Power Modelling for Multi- and Many-Core Systems Matthew J. Walker*, Stephan Diestelhorst, Geoff V. Merrett* and Bashir M. Al-Hashimi* *University of Southampton Arm Ltd. Motivation: Run-Time Management

553 views • 23 slides

More recommend