Sciweavers

5608 search results - page 8 / 1122

» On the Theory of Matchgate Computations

147

TCS
1998

103views Theoretical Computer Science» more TCS 1998»

Sample Size Lower Bounds in PAC Learning by Algorithmic Complexity Theory

15 years 5 months ago

Sample Size Lower Bounds in PAC Learning by Algorithmic Complexity Theory

Download www.dicom.uninsubria.it

Bruno Apolloni, Claudio Gentile

claim paper

Read More »

142

TCS
1998

122views Theoretical Computer Science» more TCS 1998»

Contributions of Ronald V. Book to the Theory of String-Rewriting Systems

15 years 5 months ago

Contributions of Ronald V. Book to the Theory of String-Rewriting Systems

Download www.cs.rpi.edu

Robert McNaughton

claim paper

Read More »

91

SAC
2008
ACM

108views Applied Computing» more SAC 2008»

Code-carrying theory

15 years 5 months ago

Code-carrying theory

Download www.cs.rpi.edu

Aytekin Vargun, David R. Musser

claim paper

Read More »

134

COMJ
2010

262views Applied Computing» more COMJ 2010»

Constraint Application with Higher-Order Programming for Modeling Music Theories

15 years 3 months ago

Constraint Application with Higher-Order Programming for Modeling Music Theories

Download cmr.soc.plymouth.ac.uk

Torsten Anders, Eduardo Reck Miranda

claim paper

Read More »

160

BSL
2006

109views more BSL 2006»

Computing with functionals - computability theory or computer science?

15 years 6 months ago

Computing with functionals - computability theory or computer science?

Download folk.uio.no

We review some of the history of the computability theory of functionals of higher types, and we will demonstrate how contributions from logic and theoretical computer science hav...

Dag Normann

claim paper

Read More »

« Prev « First page 8 / 1122 Last » Next »