Bokus

Kenneth J. Supowit – författare

Visar alla böcker från författaren Kenneth J. Supowit. Handla med fri frakt och snabb leverans.

4 produkter

  1. Kenneth J. Supowit - Algorithms for Constructing Computably Enumerable Sets, Inbunden. Tillgänglighet: Lägg i varukorg

    Algorithms for Constructing Computably Enumerable Sets

    Av Kenneth J. Supowit

    Inbunden, 2023

    653 kr

    Lägg i varukorg

    Logicians have developed beautiful algorithmic techniques for the construction of computably enumerable sets. This textbook presents these techniques in a unified way that should appeal to computer scientists.Specifically, the book explains, organizes, and compares various algorithmic techniques …

  2. Kenneth J. Supowit - Algorithms for Constructing Computably Enumerable Sets, E-bok. Tillgänglighet: Lägg i varukorg

    Algorithms for Constructing Computably Enumerable Sets

    Av Kenneth J. Supowit

    E-bok, 2023

    877 kr

    Lägg i varukorg

    Logicians have developed beautiful algorithmic techniques for the construction of computably enumerable sets. This textbook presents these techniques in a unified way that should appeal to computer scientists. Specifically, the book explains, organizes, and compares various algorithmic techniques …

  3. Kenneth J. Supowit - Algorithms for Constructing Computably Enumerable Sets. Tillgänglighet: Lägg i varukorg

    Algorithms for Constructing Computably Enumerable Sets

    Av Kenneth J. Supowit

    2023

    667 kr

    Lägg i varukorg

  4. Kenneth J. Supowit - Algorithms for Constructing Computably Enumerable Sets, Häftad. Tillgänglighet: Lägg i varukorg

    Algorithms for Constructing Computably Enumerable Sets

    Av Kenneth J. Supowit

    Häftad, 2024

    653 kr

    Lägg i varukorg

    Logicians have developed beautiful algorithmic techniques for the construction of computably enumerable sets. This textbook presents these techniques in a unified way that should appeal to computer scientists.Specifically, the book explains, organizes, and compares various algorithmic techniques …