PDPeter J. Denning

Peter J. Denning

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Peter J. Denning has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    AI Abundance or Luddite Revolution?

    by Peter J. Denning, Ted G. Lewis, Erol Gelenbe

    Universal basic income is not a solution to AI-induced unemployment and a sovereign wealth fund is incapable of funding it.

  • Open Access

    Tacit Knowledge and AI

    by Peter J. Denning

    We will be as unknowledgeable about what machines know about us as they are about what we know about them.

  • Open Access

    General Intelligence May Not Be Computable

    by Peter Denning

    Overview : This essay is a sweeping exploration of the idea that machines might someday display behaviors indistinguishable from human intelligence. It traces the evolution of that idea from early mechanical devices, through electronic computation, to artificial intelligence and large language models. It examines the philosophical, historical, and technological foundations of “machine intelligence”. It argues that, while machines have made extraordinary progress in replicating some aspects of human reasoning and learning, they remain fundamentally unable to reproduce tacit knowledge, which is essential for human intelligence. Tacit knowledge includes common sense, perceptions, embodied performance skill, and contextual understanding. Although machines can enhance and augment human capacities, they cannot yet, and may never, become intelligent in the human sense. The essay comes to a sobering warning that machines can develop their own tacit knowledge and intelligence, which does not understand humans and their concerns. There is a great risk of an approaching AI automation singularity — a point at which automated systems, though not as intelligent as humans, may exert pervasive control over human life, institutions, and decision-making. The essay concludes with a declaration of hope for eluding this future by practices of navigating in turbulent social space, harmonizing humans with AI machines.

  • Open Access

    The Conundrum of LLMs

    by Peter J. Denning

    With LLMs, the goods are really good and the bads are really bad.


  • Open Access

    Forecasting

    by Peter J. Denning

    Avoid large language models for jobs requiring reliable prediction.

  • Open Access

    Three AI Futures

    by Peter J. Denning

    Artificial intelligence development practices may be facilitating a drift toward an unwanted AI singularity.


  • Mathematics, Logic, and Engineering in Computing

    by Peter J. Denning, Matti Tedre

    From its beginning in the 1950s, noncomputing academics were skeptical about computer science because it seemed strong on technology and weak on theory. To answer the critics and shore up their case, computer scientists turned to a rich trove of computationalmethods from logic andmathematics.Computing from ancient times focused on methods of manipulating symbols that could be performed by people untrained in mathematics. Examples include ancient Babylonian algorithm- like step-by-step rules, Greek mathematical procedures like the Euclidean algorithm or the sieve of Eratosthenes, and al-Khwarizmi’s algorithmic techniques. In the twentieth century, the mathematical logicians Turing, G€odel, Church, Kleene, and Post provided a solid foundational theory for the new field of computer science, showingwhat can and cannot becomputed.


  • Top Cited Papers

    Computational Thinking: A Disciplinary Perspective

    by Peter J. Denning, Matti Tedre

    Over its short disciplinary history, computing has seen a stunning number of descriptions of the field's characteristic ways of thinking and practicing, under a large number of different labels. One of the more recent variants, notably in the context of K-12 education, is "computational thinking", which became popular in the early 2000s, and which has given rise to many competing views of the essential character of CT. This article analyzes CT from the perspective of computing's disciplinary ways of thinking and practicing, as expressed in writings of computing's pioneers. The article describes six windows into CT from a computing perspective: its intellectual origins and justification, its aims, and the central concepts, techniques, and ways of thinking in CT that arise from those different origins. The article also presents a way of analyzing CT over different dimensions, such as in terms of breadth vs. depth, specialization vs. generalization, and in terms of skill progression from beginner to expert. Those different views have different aims, theoretical references, conceptual frameworks, and origin stories, and they justify their intellectual essence in different ways.


  • Open Access

    Working Set Analytics

    by Peter J. Denning

    The working set model for program behavior was invented in 1965. It has stood the test of time in virtual memory management for over 50 years. It is considered the ideal for managing memory in operating systems and caches. Its superior performance was based on the principle of locality, which was discovered at the same time; locality is the observed tendency of programs to use distinct subsets of their pages over extended periods of time. This tutorial traces the development of working set theory from its origins to the present day. We will discuss the principle of locality and its experimental verification. We will show why working set memory management resists thrashing and generates near-optimal system throughput. We will present the powerful, linear-time algorithms for computing working set statistics and applying them to the design of memory systems. We will debunk several myths about locality and the performance of memory systems. We will conclude with a discussion of the application of the working set model in parallel systems, modern shared CPU caches, network edge caches, and inventory and logistics management.


  • Open Access

    COVID-19 and computation for policy

    by Jeffrey Johnson, Peter Denning, Kemal Delic, Jane Bromley

    Governments across the world are formulating and implementing medical, social, economic and other policies to manage the COVID-19 pandemic and protect their citizens. Many governments claim that their policies follow the best available scientific advice. Much of that advice comes from computational modeling. Two of the main types of model are presented: the SIR (Susceptible, Infected, Recovered) model developed by Kermack and McKendrick in the 1920s and the more recent Agent Based Models. The SIR model gives a good intuition of how epidemics spread; including how mass vaccination can contain them. It is less useful than Agent Based Modeling for investigating the effects of policies such as social distancing, self-isolation, wearing facemasks, and test-trace-isolate. Politicians and the public have been perplexed to observe the lack of consensus in the scientific community and there being no single 'best science' to follow. The outcome of computational models depends on the assumptions made and the data used. Different assumptions will lead to different computational outcomes, especially when the available data are so poor. This leads some commentators to argue that the models are wrong and dangerous. Some may be, but computational modeling is one of the few ways available to explore and try to understand the space of possible futures. This lack of certainty means that computational modeling must be seen as just one of many inputs into the political decision making process. Politicians must balance all the competing inputs and make timely decisions based on their conclusions---be they right or wrong. In the same way that democracy is the least worst form of government, computational modeling may be the least worst way of trying to understand the future for policy making.