Ask
Search
My library
ORKG

ORKG Ask

Our mission is to organize scholarly knowledge and make it accessible to humans and machines.

About

About ORKG Ask
Report issue
Statistics
Contact

Legal

Terms of use
Data protection (sheet)
Imprint
Accessibility
License

Technical

We
open source
System status
Changelog
Frontend: v1.41.0
Backend: v1.13.4

We use cookies to provide a better user experience.

Data Protection

Constructive dimension and weak truth-table degrees

Bienvenu, L.
Doty, D.
Stephan, F.

Publication date

January 2007

DOI

10.1007/978-3-540-73001-9_7

Publisher

Springer Science and Business Media LLC

Abstract

10.1007/978-3-540-73001-9_7Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)4497 LNCS63-7

Extracted data

Related items

Automatic learning from positive data and negative counterexamples

Jain, S.
Kinber, E.

January 2012

10.1007/978-3-642-34106-9_9Lecture Notes in Computer Science (including subseries Lecture Notes in A...

Iterative learning from positive data and negative counterexamples

Jain, S.
Kinber, E.

January 2006

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Enlarging learnable classes

Jain, S.
Kötzing, T.
Stephan, F.

January 2012

10.1007/978-3-642-34106-9_7Lecture Notes in Computer Science (including subseries Lecture Notes in A...

Degrees of weakly computable reals

Ng, K.M.
Stephan, F.
Wu, G.

January 2006

10.1007/11780342_43Lecture Notes in Computer Science (including subseries Lecture Notes in Artificia...

Constructive dimension and weak truth-table degrees

Laurent Bienvenu
David Doty
Frank Stephan

January 2007

This paper examines the constructive Hausdorff and packing dimensions of weak truth-table degrees. T...

Thin maximal antichains in the turing degrees

Chong, C.T.
Yu, L.

January 2007

10.1007/978-3-540-73001-9_17Lecture Notes in Computer Science (including subseries Lecture Notes in ...

Manifestation and exploitation of invariants in bioinformatics

Wong, L.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

High minimal pairs in the enumeration degrees

Sorbi, A.
Wu, G.
Yang, Y.

January 2009

10.1007/978-3-642-02017-9_36Lecture Notes in Computer Science (including subseries Lecture Notes in ...

On the amount of nonconstructivity in learning formal languages from positive data

Jain, S.
Stephan, F.
Zeugmann, T.

January 2012

10.1007/978-3-642-29952-0_41Lecture Notes in Computer Science (including subseries Lecture Notes in ...

Semi-automatic ground truth generation for chart image recognition

Yang, L.
Huang, W.
Tan, C.L.

January 2006

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Degree structures below 0'

Liu, Jiang

January 2010

This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...

The dot-depth and the polynomial hierarchy correspond on the delta levels

Borchert, B.
Lange, K.-J.
Stephan, F.
Tesson, P.
Thérien, D.

January 2004

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Learning languages from positive data and negative counterexamples

Jain, S.
Kinber, E.

January 2004

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)324454-68LN...

Automated verification of shape and size properties via separation logic

Nguyen, H.H.
David, C.
Qin, S.
Chin, W.-N.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Universite ́ de Provence

Laurent Bienvenu
David Doty
Frank Stephan

November 2015

This paper examines the constructive Hausdorff and packing dimensions of Turing degrees. The main re...

Automatic learning from positive data and negative counterexamples

Jain, S.
Kinber, E.

January 2012

10.1007/978-3-642-34106-9_9Lecture Notes in Computer Science (including subseries Lecture Notes in A...

Iterative learning from positive data and negative counterexamples

Jain, S.
Kinber, E.

January 2006

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Enlarging learnable classes

Jain, S.
Kötzing, T.
Stephan, F.

January 2012

10.1007/978-3-642-34106-9_7Lecture Notes in Computer Science (including subseries Lecture Notes in A...

Degrees of weakly computable reals

Ng, K.M.
Stephan, F.
Wu, G.

January 2006

10.1007/11780342_43Lecture Notes in Computer Science (including subseries Lecture Notes in Artificia...

Constructive dimension and weak truth-table degrees

Laurent Bienvenu
David Doty
Frank Stephan

January 2007

This paper examines the constructive Hausdorff and packing dimensions of weak truth-table degrees. T...

Thin maximal antichains in the turing degrees

Chong, C.T.
Yu, L.

January 2007

10.1007/978-3-540-73001-9_17Lecture Notes in Computer Science (including subseries Lecture Notes in ...

Manifestation and exploitation of invariants in bioinformatics

Wong, L.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

High minimal pairs in the enumeration degrees

Sorbi, A.
Wu, G.
Yang, Y.

January 2009

10.1007/978-3-642-02017-9_36Lecture Notes in Computer Science (including subseries Lecture Notes in ...

On the amount of nonconstructivity in learning formal languages from positive data

Jain, S.
Stephan, F.
Zeugmann, T.

January 2012

10.1007/978-3-642-29952-0_41Lecture Notes in Computer Science (including subseries Lecture Notes in ...

Semi-automatic ground truth generation for chart image recognition

Yang, L.
Huang, W.
Tan, C.L.

January 2006

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Degree structures below 0'

Liu, Jiang

January 2010

This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...

The dot-depth and the polynomial hierarchy correspond on the delta levels

Borchert, B.
Lange, K.-J.
Stephan, F.
Tesson, P.
Thérien, D.

January 2004

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Learning languages from positive data and negative counterexamples

Jain, S.
Kinber, E.

January 2004

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)324454-68LN...

Automated verification of shape and size properties via separation logic

Nguyen, H.H.
David, C.
Qin, S.
Chin, W.-N.

January 2007

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Universite ́ de Provence

Laurent Bienvenu
David Doty
Frank Stephan

November 2015

This paper examines the constructive Hausdorff and packing dimensions of Turing degrees. The main re...

Automatic learning from positive data and negative counterexamples

Jain, S.
Kinber, E.

January 2012

10.1007/978-3-642-34106-9_9Lecture Notes in Computer Science (including subseries Lecture Notes in A...

Iterative learning from positive data and negative counterexamples

Jain, S.
Kinber, E.

January 2006

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Enlarging learnable classes

Jain, S.
Kötzing, T.
Stephan, F.

January 2012

10.1007/978-3-642-34106-9_7Lecture Notes in Computer Science (including subseries Lecture Notes in A...