Journal of Logic, Language, and Information, Vol. 22, No. 4, LOGIC AND COGNITION (Autumn 2013), pp. 363-390 (28 pages) We report two experiments which tested whether cognitive capacities are limited ...

Raz, a professor at Princeton University and the Weizmann Institute of Science, and Tal, a postdoctoral fellow at Stanford University, define a specific kind of computational problem. They prove, with ...

The Journal of the Operational Research Society, Vol. 66, No. 9 (SEPTEMBER 2015), pp. 1430-1441 (12 pages) In the multi-depot vehicle routing problem (MDVRP), there are several depots where vehicles ...

Diagrams of simple machines—a pulley, an inclined plane, a lever—appeared on the massive whiteboard of a school STEAM lab (science, technology, engineering, and mathematics plus art) in South Fayette, ...

Early on in the study of quantum computers, computer scientists posed a question whose answer, they knew, would reveal something deep about the power of these futuristic machines. Twenty-five years ...

The most widely used technique for finding the largest or smallest values of a math function turns out to be a fundamentally difficult computational problem. Many aspects of modern applied research ...

A proof made public today illustrates that Stephen Wolfram's 2,3 Turing machine number 596440 is a universal Turing machine, and it has netted a University of Birmingham undergraduate $25,000. In 1936 ...

Kenneth Merz, Ph.D., of Cleveland Clinic's Center for Computational Life Sciences, and a research team are testing quantum computing's abilities in chemistry through integrating machine learning and ...

We are clearly on the verge of a revolution in medicine—one in which the sequence of As, Ts, Gs, and Cs is as much a part of a patient’s phenotypic profile as are the sounds of the heart or were the ...