Ordinal Computability

Beschreibung

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.

Autor*in

Merlin Carl

Themen in »Ordinal Computability«

Berechenbarkeit Turing-Maschine Registermaschine

Stimmen zu »Ordinal Computability«

Details

Link teilen