Ordinal computability : an introduction to infinitary machines

Author(s)

    • Carl, Merlin

Bibliographic Information

Ordinal computability : an introduction to infinitary machines

Merlin Carl

(De Gruyter series in logic and its applications, v. 9)

De Gruyter, c2019

Available at  / 4 libraries

Search this Book/Journal

Note

Includes bibliographical references (p. [313]-321) and index

Description and Table of Contents

Description

Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to transfinite working time and space. In particular, recognizability, randomness, and applications to other areas of mathematics are covered.

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

  • NCID
    BB29010914
  • ISBN
    • 9783110495621
  • Country Code
    gw
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    Berlin
  • Pages/Volumes
    viii, 333 p.
  • Size
    25 cm
  • Classification
  • Parent Bibliography ID
Page Top