MCS

Results: 1481



#Item
261Microcontrollers / Computing / Computer hardware / Computer engineering / BASIC Stamp / PIC microcontroller / Parallax /  Inc. / PBASIC / Intel MCS-48

Digi-Key Catalog CH2011-EN Page 649

Add to Reading List

Source URL: dkc3.digikey.com

Language: English - Date: 2011-04-14 10:57:57
262

September 26, 2006 SLENDER CLASSES. ´ ROD DOWNEY AND ANTONIO MONTALBAN Definition 0.1. A Π01 class S is slender if for every other Π01 class F , there exists a clopen

Add to Reading List

Source URL: www.mcs.vuw.ac.nz

Language: English - Date: 2007-11-05 21:38:26
    263

    SUBSPACES OF COMPUTABLE VECTOR SPACES RODNEY G. DOWNEY, DENIS R. HIRSCHFELDT, ASHER M. KACH, ´ STEFFEN LEMPP, JOSEPH R. MILETI, AND ANTONIO MONTALBAN Abstract. We show that the existence of a nontrivial proper subspace

    Add to Reading List

    Source URL: www.mcs.vuw.ac.nz

    Language: English - Date: 2006-06-19 23:31:25
      264

      MATHEMATICAL MODAL LOGIC: A VIEW OF ITS EVOLUTION Robert Goldblattthere is no one fundamental logical notion of necessity, nor consequently of possibility. If this conclusion is valid, the subject of modality ough

      Add to Reading List

      Source URL: homepages.mcs.vuw.ac.nz

      Language: English - Date: 2012-01-15 23:20:40
        265

        ARITHMETICAL SACKS FORCING ROD DOWNEY AND LIANG YU Abstract. We answer a question of Jockusch by constructing a hyperimmunefree minimal degree below a 1-generic one. To do this we introduce a new forcing notion called ar

        Add to Reading List

        Source URL: www.mcs.vuw.ac.nz

        Language: English - Date: 2005-04-04 21:44:59
          266Microcontrollers / Computing / Computer hardware / Computer engineering / BASIC Stamp / PIC microcontroller / Parallax /  Inc. / PBASIC / Intel MCS-48

          Digi-Key Catalog EU2011-EN Page 649

          Add to Reading List

          Source URL: dkc3.digikey.com

          Language: English - Date: 2011-03-09 14:19:45
          267

          Presentations of computably enumerable reals Rodney G. Downey and Geoffrey L. LaForte October 25, 2006 Abstract We study the relationship between a computably enumerable real and its presentations: ways of approximating

          Add to Reading List

          Source URL: www.mcs.vuw.ac.nz

          Language: English - Date: 2006-10-24 21:03:37
            268

            THE COMPLEXITY OF ORBITS OF COMPUTABLY ENUMERABLE SETS PETER A. CHOLAK, RODNEY DOWNEY, AND LEO A. HARRINGTON Abstract. The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, suc

            Add to Reading List

            Source URL: www.mcs.vuw.ac.nz

            Language: English - Date: 2007-11-05 21:38:57
              269

              Bounded Fixed-Parameter Tractability and Reducibility Rod Downey J¨org Flum Martin Grohe

              Add to Reading List

              Source URL: www.mcs.vuw.ac.nz

              Language: English - Date: 2006-08-16 16:31:56
                270

                Parameterized Complexity for the Skeptic Rod Downey School of Mathematical and Computing Sciences Victoria University P. O. Box 600 Wellington, New Zealand

                Add to Reading List

                Source URL: www.mcs.vuw.ac.nz

                Language: English - Date: 2003-05-01 18:15:50
                  UPDATE