fundamentals

TwitterFacebook
Get flash to fully experience Pearltrees

Harry Foundalis - The Bongard Problems

The domain in which I did my research in cognitive science is the Bongard Problems . These are problems on visual pattern recognition that appeared first in the appendix of a book published by the Russian scientist M. http://www.foundalis.com/res/diss_research.html
I spent most of yesterday afternoon working on a paper I’m co-writing.

10 Papers Every Programmer Should Read (At Least Twice)

http://blog.objectmentor.com/articles/2009/02/26/10-papers-every-programmer-should-read-at-least-twice
About Massachusetts Institute of Technology The Massachusetts Institute of Technology (MIT), founded in 1861, is located in Cambridge, Massachusetts, and is one of the foremost U.S. institutions in science and technology. It is comprised of five schools and one college, including the renowned School of Engineering and Sloan School of Management, offering Bachelor's, Master's, and Doctorate degrees. http://academicearth.org/courses/introduction-to-algorithms

Introduction to Algorithms | MIT Video Course

In computer science , the process calculi (or process algebras ) are a diverse family of related approaches for formally modelling concurrent systems . Process calculi provide a tool for the high-level description of interactions, communications, and synchronizations between a collection of independent agents or processes. http://en.wikipedia.org/wiki/Process_calculus

Process calculus

http://en.wikipedia.org/wiki/Turing_completeness In computability theory , a system of data-manipulation rules (such as a computer's instruction set , a programming language , or a cellular automaton ) is said to be Turing complete or computationally universal if it can be used to simulate any single-taped Turing machine . A classic example is the lambda calculus .

Turing completeness

http://en.wikipedia.org/wiki/Turing_machine

Turing machine

An artistic representation of a Turing machine (Rules table not represented)