A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Notions of semicomputability in topological algebras over the reals

2018
*
Computability - The Journal of the Assosiation
*

Lay Abstract We investigate to what extent certain well-known results of classical computability theory on the natural numbers hold in the context of generalised computability theories on the real numbers. Abstract Several results from classical computability theory (computability over discrete structures such as the natural numbers and strings over finite alphabets, due to Turing, Church, Kleene and others) have been shown to hold for a generalisation of computability theory over total

doi:10.3233/com-180087
fatcat:ra6vmzvqtnbetfn5piszhmhwiq