12 found
  1. Recursively Enumerable Generic Sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
    We show that one can solve Post's Problem by constructing generic sets in the usual set theoretic framework applied to tiny universes. This method leads to a new class of recursively enumerable sets: r.e. generic sets. All r.e. generic sets are low and simple and therefore of Turing degree strictly between 0 and 0'. Further they supply the first example of a class of low recursively enumerable sets which are automorphic in the lattice E of recursively enumerable sets with inclusion. (...)
    Direct download (8 more)  
    Export citation  
    Bookmark   12 citations  
  2. On the Orbits of Hyperhypersimple Sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
    This paper contributes to the question of under which conditions recursively enumerable sets with isomorphic lattices of recursively enumerable supersets are automorphic in the lattice of all recursively enumerable sets. We show that hyperhypersimple sets (i.e. sets where the recursively enumerable supersets form a Boolean algebra) are automorphic if there is a Σ 0 3 -definable isomorphism between their lattices of supersets. Lerman, Shore and Soare have shown that this is not true if one replaces Σ 0 3 by Σ (...)
    Direct download (7 more)  
    Export citation  
    Bookmark   5 citations  
  3.  7
    The Intervals of the Lattice of Recursively Enumerable Sets Determined by Major Subsets.Wolfgang Maass & Michael Stob - 1983 - Annals of Pure and Applied Logic 24 (2):189-212.
  4. The Uniform Regular Set Theorem in Α-Recursion Theory.Wolfgang Maass - 1978 - Journal of Symbolic Logic 43 (2):270-279.
  5.  8
    Inadmissibility, Tame R.E. Sets and the Admissible Collapse.Wolfgang Maass - 1978 - Annals of Mathematical Logic 13 (2):149-170.
  6.  12
    Martin D. Davis and Elaine J. Weyuker. Comparability, Complexity, and Languages. Fundamentals of Theoretical Computer Science. Computer Science and Applied Mathematics. Academic Press, New York Etc. 1983, Xix + 425 Pp. [REVIEW]Wolfgang Maass - 1987 - Journal of Symbolic Logic 52 (1):293-294.
  7.  13
    Variations on Promptly Simple Sets.Wolfgang Maass - 1985 - Journal of Symbolic Logic 50 (1):138-148.
  8.  6
    Major Subsets and Automorphisms of Recursively Enumerable Sets.Wolfgang Maass - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 21.
  9.  25
    On the Use of Inaccessible Numbers and Order Indiscernibles in Lower Bound Arguments for Random Access Machines.Wolfgang Maass - 1988 - Journal of Symbolic Logic 53 (4):1098-1109.
    We prove optimal lower bounds on the computation time for several well-known test problems on a quite realistic computational model: the random access machine. These lower bound arguments may be of special interest for logicians because they rely on finitary analogues of two important concepts from mathematical logic: inaccessible numbers and order indiscernibles.
    Direct download (8 more)  
    Export citation  
    Bookmark   1 citation  
  10.  27
    Perspectives of the High‐Dimensional Dynamics of Neural Microcircuits From the Point of View of Low‐Dimensional Readouts.Stefan Häusler, Henry Markram & Wolfgang Maass - 2003 - Complexity 8 (4):39-50.
  11. Contributions to [Alpha]- and [Beta]-Recursion Theory.Wolfgang Maass - 1978 - Minerva-Publikation.
    Export citation  
  12. Vapnik-Chervonenkis Dimension of Neural Nets.Wolfgang Maass - 1995 - In Michael A. Arbib (ed.), Handbook of Brain Theory and Neural Networks. MIT Press. pp. 1000--1003.
    Export citation