KGC 1997 - PDF Preprint Papers

KGC 1997 Kurt Godel Colloquium

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed KGC-1997 Paper

click to vote

KGC
1997
Springer

86views Automated Reasoning» more KGC 1997»

Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory

1 years 9 months ago

Download www2-fs.informatik.uni-tuebingen.de

Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting p...

Bernd Borchert, Frank Stephan

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	86	Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory	claim
2	71	The Undecidability of Simultaneous Rigid E-Unification with Two Variables	claim
3	68	Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization	claim
4	68	Sketch-as-Proof	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers