Teoria da Computação
225 views | +0 today

# Teoria da Computação

Tópicos de teoria da computação para o cidadão contemporâneo.
 Scooped by André Souza Lemos

## Teoria da computação - YouTube

Share your videos with friends, family, and the world
No comment yet.
 Scooped by André Souza Lemos

## Cobham's thesis - Wikipedia, the free encyclopedia

Cobham's thesis, also known as Cobham–Edmonds thesis (named after Alan Cobham and Jack Edmonds),[2][3][4] asserts that computational problems can be feasibly computed on some computational device only if they can be computed in polynomial time; that is, if they lie in the complexity class P.[5]

Formally, to say that a problem can be solved in polynomial time is to say that there exists an algorithm that, given an n-bit instance of the problem as input, can produce a solution in time O(nc), where c is a constant that depends on the problem but not the particular instance of the problem.

Alan Cobham's 1965 paper entitled "The intrinsic computational difficulty of functions"[6] is one of the earliest mentions of the concept of the complexity class P, consisting of problems decidable in polynomial time. Cobham theorized that this complexity class was a good way to describe the set of feasibly computable problems. Any problem that cannot be contained in P is not feasible, but if a real-world problem can be solved by an algorithm existing in P, generally such an algorithm will eventually be discovered.

André Souza Lemos's insight:

Problemas (supostamente) tratáveis e a classe P.

No comment yet.
 Scooped by André Souza Lemos

## Computational Complexity for Dummies, an Introduction

Problems that we use computers to solve can be divided into three basic classes: easy to solve hard to solve impossible to solve Pretty much all the algorithms we use day-to-day fall into the easy ...
No comment yet.
 Scooped by André Souza Lemos

## Complexity Classes

No comment yet.
 Scooped by André Souza Lemos

No comment yet.