Todd Wareham
YOU?
Author Swipe
View article: The Computational Complexity of Circuit Discovery for Inner Interpretability
The Computational Complexity of Circuit Discovery for Inner Interpretability Open
Many proposed applications of neural networks in machine learning, cognitive/brain science, and society hinge on the feasibility of inner interpretability via circuit discovery. This calls for empirical and theoretical explorations of viab…
View article: A Computational Complexity Perspective on Segmentation as a Cognitive Subcomputation
A Computational Complexity Perspective on Segmentation as a Cognitive Subcomputation Open
Computational feasibility is a widespread concern that guides the framing and modeling of natural and artificial intelligence. The specification of cognitive system capacities is often shaped by unexamined intuitive assumptions about the s…
View article: Swarm Control for Distributed Construction: A Computational Complexity Perspective
Swarm Control for Distributed Construction: A Computational Complexity Perspective Open
Over the last 20 years, human interaction with robot swarms has been investigated as a means to mitigate problems associated with the control and coordination of such swarms by either human teleoperation or completely autonomous swarms. On…
View article: Viable Algorithmic Options for Creating and Adapting Emergent Software Systems
Viable Algorithmic Options for Creating and Adapting Emergent Software Systems Open
Given the complexity of modern software systems, it is of great importance that such systems be able to autonomously modify themselves, i.e., self-adapt, with minimal human supervision. It is critical that this adaptation both results in r…
View article: Environmental Sensing Options for Robot Teams: A Computational Complexity Perspective
Environmental Sensing Options for Robot Teams: A Computational Complexity Perspective Open
Visual and scalar-field (e.g., chemical) sensing are two of the options robot teams can use to perceive their environments when performing tasks. We give the first comparison of the computational characteristic of visual and scalar-field s…
View article: Exploring Viable Algorithmic Options for Automatically Creating and Reconfiguring Component-based Software Systems: A Computational Complexity Approach (Full Version)
Exploring Viable Algorithmic Options for Automatically Creating and Reconfiguring Component-based Software Systems: A Computational Complexity Approach (Full Version) Open
Component-Based Development (CBD) is a popular approach to mitigating the costs of creating software systems. However, it is not clear to what extent the core component selection and adaptation activities of CBD can be implemented to opera…
View article: Exploring Viable Algorithmic Options for Learning from Demonstration (LfD): A Parameterized Complexity Approach
Exploring Viable Algorithmic Options for Learning from Demonstration (LfD): A Parameterized Complexity Approach Open
The key to reconciling the polynomial-time intractability of many machine learning tasks in the worst case with the surprising solvability of these tasks by heuristic algorithms in practice seems to be exploiting restrictions on real-world…
View article: Computational Complexity of Segmentation
Computational Complexity of Segmentation Open
Computational feasibility is a widespread concern that guides the framing and modeling of biological and artificial intelligence. The specification of cognitive system capacities is often shaped by unexamined intuitive assumptions about th…
View article: Why is scaling up models of language evolution hard?
Why is scaling up models of language evolution hard? Open
Computational model simulations have been very fruitful for gaining insight into how the systematic structure we observe in the world’s natural languages could have emerged through cultural evolution. However, these model simulations opera…
View article: How hard is cognitive science?
How hard is cognitive science? Open
This is a preprint version of a published paper. Please cite as: Rich, P., de Haan, R., Wareham, T., & van Rooij, I. (2021). How hard is cognitive science? Proceedings of the Annual Meeting of the Cognitive Science Society, 43. Retriev…
View article: Cognition and Intractability
Cognition and Intractability Open
Intractability is a growing concern across the cognitive sciences: while many models of cognition can describe and predict human behavior in the lab, it remains unclear how these models can scale to situations of real-world complexity. Cog…
View article: Deep Analogical Inference as the Origin of Hypotheses
Deep Analogical Inference as the Origin of Hypotheses Open
The ability to generate novel hypotheses is an important problem-solving capacity of humans. This ability is vital for making sense of the complex and unfamiliar world we live in. Often, this capacity is characterized as an inference to th…
View article: The Roles of Internal Representation and Processing in Problem Solving Involving Insight: A Computational Complexity Perspective
The Roles of Internal Representation and Processing in Problem Solving Involving Insight: A Computational Complexity Perspective Open
In human problem solving, there is a wide variation between individuals in problem solution time and success rate, regardless of whether or not this problem solving involves insight. In this paper, we apply computational and parameterized …
View article: Deep analogical inference as the origin of hypotheses
Deep analogical inference as the origin of hypotheses Open
The ability to generate novel hypotheses is an important problem solving capacity of humans. This ability is vital for making sense of the complex and unfamiliar world we live in. Often, this capacity is characterized as an inference to th…
View article: Demons of Ecological Rationality
Demons of Ecological Rationality Open
Contains fulltext : 191146.pdf (Publisher’s version ) (Open Access)
View article: On the Computational Complexity of Software (Re)Modularization: Elaborations and Opportunities
On the Computational Complexity of Software (Re)Modularization: Elaborations and Opportunities Open
Software system modularization and remodularization are key challenges in software engineering. All previous research has assumed that these problems are computationally intractable and hence focused on heuristic methods such as hill-climb…
View article: Exploruing Algorithmic Options for the Efficient Design and Reconfiguration of Reactive Robot Swarms
Exploruing Algorithmic Options for the Efficient Design and Reconfiguration of Reactive Robot Swarms Open
A key challenge in robot swarm engineering is the design of individual robot controllers such that the robots as a group can perform a specified task. In this paper, we explore algorithmic options for designing and reconfiguring swarms of …
View article: On the Computational Complexity of Designing and Reconfiguring Component-based Software Systems
On the Computational Complexity of Designing and Reconfiguring Component-based Software Systems Open
Though Component-Based Development (CBD) is a popular approach to mitigating the costs of creating software systems, it is not clear to what extent CBD is preferable to other approaches to software engineering or to what extent the core co…