Communications of the ACM. 

 - New York :  Association for Computing Machinery (ACM),  c2023. 
 - 104 pages :  color illustrations ;  28 cm. 
 -  Communications of the ACM, Volume 66, Issue 5, May 2023 .
<br/><br/>Includes bibliographical references. 
<br/><br/>ACM for the Public Good -- A Career Built on Using Technology to Help Others -- Securing Data for Business Telephones -- AlphaFold Spreads through Protein Science -- Locking Down Secure Open Source Software -- Women in Computer Science Are Making Strides -- Do the Right Thing -- Updates, Threats, and Risk Management -- Putting a Teaspoon of Programming into Other Subjects -- Ethics as a Participatory and Iterative Process -- Please Report Your Compute -- Long-Term Mentoring for Computer Science Researchers -- NSF on Chien's Grand Challenge for Sustainability --  Reinventing Backend Subsetting at Google -- Research for Practice: The Fun in Fuzzing -- From Code Complexity Metrics to Program Comprehension -- Development Use Cases for Semantics-Driven Modeling Languages -- Unlocking the Potential of Fully Homomorphic Encryption -- Disentangling Hype from Practicality: On Realistically Achieving Quantum Advantage -- Technical Perspective: Finding Connections between One-Way Functions and Kolmogorov Complexity -- Toward Basing Cryptography on the Hardness of EXP -- ChatGPT, Can You Tell Me a Story? An Exercise in Challenging the True Creativity of Generative AI. 
<br/><br/> [Article Title: ACM for the Public Good/ Moshe Y. Vardi, p. 5]<br/><br/>  https://doi.org/10.1145/3589609  [Article Title: A Career Built on Using Technology to Help Others/ Jules Maitland, p. 7]<br/>  https://doi.org/10.1145/3587170  [Article Title: Securing Data for Business Telephones/ Alex Tray, p. 8-9]<br/>  https://doi.org/10.1145/3586581  [Article Title: AlphaFold Spreads through Protein Science/ Chris Edwards, p. 10-12]<br/><br/>Abstract: Based on machine learning, DeepMind's code now lies at the heart of a variety of protein-structure tools and workflows. It may ultimately be replaced by models that are bigger but faster.  https://doi.org/10.1145/3586582  [Article Title: Locking Down Secure Open Source Software/ Neil Savage, p. 13-14]<br/><br/>Abstract: Can even secure open source software ever be considered truly safe?  https://doi.org/10.1145/3586584  [Article Title: Women in Computer Science Are Making Strides/ Esther Shein, p .15-17]<br/><br/>Abstract: Computer science is still not a level playing field for those women who majored in it and choose to pursue it as a career.  https://doi.org/10.1145/3586583  [Article Title: Do the Right Thing/ Kendra Albert and James Grimmelmann, p. 18-20]<br/><br/>Abstract: Exploring the intersection of legal compliance and ethical judgment.<br/><br/>   https://doi.org/10.1145/3587825  [Article Title: Updates, Threats, and Risk Management/ Steve Lipner and John Pescatore, p. 21-23]<br/><br/>Abstract: Revisiting a recent column considering security updates.<br/><br/>  https://doi.org/10.1145/3587826  [Article Title: Putting a Teaspoon of Programming into Other Subjects/ Mark Guzdial, Emma Dodoo, Bahare Naimpour, Tamara Nelson-Fromm and Aadarsh Padiyath, p. 24-26]<br/><br/>Abstract: Using teaspoon languages to integrate programming across myriad academic disciplines.  https://doi.org/10.1145/3587926  [Article Title: Ethics as a Participatory and Iterative Process/ Marc Steen, p. 27-29]<br/><br/>Abstract: Facilitating ethical reflection, inquiry, and deliberation.  https://doi.org/10.1145/3550069  [Article Title: Please Report Your Compute/ Jaime Sevilla, Anson Ho and Tamay Besiroglu, p. 30-32]<br/><br/>Abstract: Seeking consistent means of measure.<br/><br/>  https://doi.org/10.1145/3563035  [Article Title: Long-Term Mentoring for Computer Science Researchers/ Emily Ruppel, Sihang Liu, Elba Garza, Sukyoung Ryu, Alexandra Silva and Talia Ringer, p. 33-35]<br/><br/>Abstract: Reaching out across computer science research communities.  https://doi.org/10.1145/3564287  [Article Title: NSF on Chien's Grand Challenge for Sustainability/ Nina Amla, Dilma Da Silva, Michael Littman and Manish Parashar, p. 36-37]<br/><br/>  https://doi.org/10.1145/3586992  [Article Title: Reinventing Backend Subsetting at Google/ Peter Ward, Paul Wankadia and Kavita Guliani, p. 40-47]<br/><br/>Abstract: Designing an algorithm with reduced connection churn that could replace deterministic subsetting.<br/><br/>  https://doi.org/10.1145/3588863  [Article Title: Research for Practice: The Fun in Fuzzing/ Stefan Nagy, p. 48-50]<br/><br/>Abstract: The debugging technique comes into its own.  https://doi.org/10.1145/3588045  [Article Title: From Code Complexity Metrics to Program Comprehension/ Dror G. Feitelson, p. 52-61]<br/><br/>Abstract: Understanding code depends not only on the code but also on the brain.<br/><br/>  https://doi.org/10.1145/3546576  [Article Title: Development Use Cases for Semantics-Driven Modeling Languages/ Manfred Broy and Bernhard Rumpe, p. 62-71]<br/><br/>Abstract: Choosing underlying semantic theories and definition techniques must closely follow intended use cases for the modeling language.  https://doi.org/10.1145/3569927  [Article Title: Unlocking the Potential of Fully Homomorphic Encryption/ Shruthi Gorantala, Rob Springer and Bryant Gipson, p. 72-81]<br/><br/>Abstract: Exploring the transformational potential of FHE and the path toward adoption of its "stack."  https://doi.org/10.1145/3572832  [Article Title: Disentangling Hype from Practicality: On Realistically Achieving Quantum Advantage/ Torsten Hoefler, Thomas Häner and Matthias Troyer, p. 82-87]<br/><br/>Abstract: What are the promising applications to realize quantum advantage?<br/><br/>  https://doi.org/10.1145/3571725  [Article Title: Technical Perspective: Finding Connections between One-Way Functions and Kolmogorov Complexity/ Gil Segev. p. 90]<br/><br/><br/><br/>   https://doi.org/10.1145/3587166  [Article Title: Toward Basing Cryptography on the Hardness of EXP/ Yanyi Liu and Rafael Pass, p. 91-99]<br/><br/>Abstract: Let Kt(x) denote the Levin-Kolmogorov Complexity of the string x, and let MKtP denote the language of pairs (x, k) having the property that Kt(x) ≤ k. We demonstrate that:<br/><br/>• MKtP ∉ HeurnegBPP (i.e., MKtP is two-sided error mildly average-case hard) iff infinitely-often OWFs exist.<br/><br/>• MKtP ∉ AvgnegBPP (i.e., MKtP is errorless mildly average-case hard) iff EXP ≠ BPP.<br/><br/>Taken together, these results show that the only "gap" toward getting (infinitely-often) OWFs from the assumption that EXP ≠ BPP is the seemingly "minor" technical gap between two-sided error and errorless average-case hardness of the MKtP problem.  https://doi.org/10.1145/3587167  [Article Title: ChatGPT, Can You Tell Me a Story? An Exercise in Challenging the True Creativity of Generative AI/ Ralph Raiola, p. 104]<br/><br/>Abstract: From the intersection of computational science and technological speculation, with boundaries limited only by our ability to imagine what could be.  https://doi.org/10.1145/3587998