Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

FEALORA

Financiado

Cerrado

Feasibility logic and randomness in computational complexity

"We will study fundamental problems in complexity theory using means developed in logic, specifically, in the filed of proof complexity. Since these problems seem extremely difficult and little progress has been achieved in solvin... ver más

31/12/2018

CAS

1M€

Presupuesto del proyecto: 1M€

Líder del proyecto

MATEMATICKY USTAV AV CR V.V.I. No se ha especificado una descripción o un objeto social para esta compañía.

Fecha límite participación Sin fecha límite de participación.

Financiación concedida El organismo FP7 notifico la concesión del proyecto el día 2018-12-31 No tenemos la información de la convocatoria

0% 100% 100%

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

1 Participantes

CAS

0.00€ | Lider

Proyectos interesantes

POCOCOP

Applied Physics

Data Science

8M€ Cerrado

EXCICO

Applied Physics

Data Science

180K€ Cerrado

MTM2008-06435

Applied Physics

Data Science

20K€ Cerrado

ACOSE

Applied Physics

Data Science

252K€ Cerrado

MTM2008-06435

Applied Physics

Data Science

20K€ Cerrado

APGRAPH

Applied Physics

Data Science

818K€ Cerrado

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Líder del proyecto

MATEMATICKY USTAV AV CR V.V.I. No se ha especificado una descripción o un objeto social para esta compañía.

Presupuesto del proyecto 1M€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto "We will study fundamental problems in complexity theory using means developed in logic, specifically, in the filed of proof complexity. Since these problems seem extremely difficult and little progress has been achieved in solving them, we will prove results that will explain why they are so difficult and in which direction theory should be developed. Our aim is to develop a system of conjectures based on the concepts of feasible incompleteness and pseudorandomness. Feasible incompleteness refers to conjectures about unprovability of statements concerning low complexity computations and about lengths of proofs of finite consistency statements. Essentially, they say that incompleteness in the finite domain behaves in a similar way as in the infinite. Several conjectures of this kind have been already stated. They have strong consequences concerning separation of complexity classes, but only a few special cases have been proved. We want to develop a unified system which will also include conjectures connecting feasible incompleteness with pseudorandomness. A major part of our work will concern proving special cases and relativized versions of these conjectures in order to provide evidence for their truth. We believe that the essence of the fundamental problems in complexity theory is logical, and thus developing theory in the way described above will eventually lead to their solution."

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores