PP-2019-10: Surreal Blum-Shub-Smale Machines

PP-2019-10: Galeotti, Lorenzo (2019) Surreal Blum-Shub-Smale Machines. [Pre-print] (In Press)

[thumbnail of BSSGaleotti2019PrePrint.pdf]

Download (346kB) | Preview


Blum-Shub-Smale machines are a classical model of com- putability over the real line. In [9], Koepke and Seyfferth generalised Blum-Shub-Smale machines to a transfinite model of computability by allowing them to run for a transfinite amount of time. The model of Koepke and Seyfferth is asymmetric in the following sense: while their machines can run for a transfinite number of steps, they use real num- bers rather than their transfinite analogues. In this paper we will use the surreal numbers in order to define a generalisation of Blum-Shub-Smale machines in which both time and register content are transfinite.

Item Type: Pre-print
Report Nr: PP-2019-10
Series Name: Prepublication (PP) Series
Year: 2019
Subjects: Computation
Depositing User: lgaleot1
Date Deposited: 07 Apr 2019 14:08
Last Modified: 07 Apr 2019 14:08
URI: https://eprints.illc.uva.nl/id/eprint/1670

Actions (login required)

View Item View Item