Computational Complexity News Today

Category: Academics; Vendor: UNIVERSITY OF CAPE TOWN (UCT).

This is a response to Thinking About Filtered Evidence Is (Very!) Hard that I thought deserved to be its own post. …

In 1969, Marvin Minsky and Seymour Papert published Perceptrons: An Introduction to Computational Geometry. In it, they showed that a single-layer perceptron cannot compute the XOR function. The main argument relies on linear separability: Perceptrons are linear classifiers, which essentially means drawing a line to separate input that would result in 1 versus 0. You can do it in the OR and AND case, but not XOR. Of course, we’re way past that now, neural networks with one hidden layer can s...

Latest Research by our Team

MIT Professor Guy Bresler studies computational complexity and researches techniques to learn models from data. A theoretician, he works at the interface of computer science, statistics, probability, and information theory.

 E-Mail IMAGE: Scott Aaronson, a Professor of Computer Science at the University of Texas, Austin, has been selected as the recipient of the 2020 ACM Prize in Computing. Aaronson is recognized for... view more  Credit: Association for Computing Machinery ACM, the Association for Computing Machinery, today announced that Scott Aaronson has been named the recipient of the 2020 ACM Prize in Computing for groundbreaking contributions to quantum computing. Aaronson is the David J. Bruton J...

Instructor:  Teaching Fellow: Gal Koplewitz, galkop@gmail.com. Office hours: Thursdays 3-4, Maxwell Dworkin second floor lounge. This course examines papers every computer scientist should have read, from the 1930s to the present. It is meant to be a synthesizing experience for advanced students in computer science: a way for them to see the field as a whole, not through a survey, but by reliving the experience of its creation. The idea is to create a unified view of the field of computer s...