2021
DOI: 10.3390/systems9020044
|View full text |Cite
|
Sign up to set email alerts
|

A Note on the Reality of Incomputable Real Numbers and Its Systemic Significance

Abstract: We discuss mathematical and physical arguments contrasting continuous and discrete, limitless discretization as arbitrary granularity. In this regard, we focus on Incomputable (lacking an algorithm that computes in finite time) Real Numbers (IRNs). We consider how, for measurements, the usual approach to dealing with IRNs is to approximate to avoid the need for more detailed, unrealistic surveys. In this regard, we contrast effective computation and emergent computation. Furthermore, we consider the alternativ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 62 publications
0
1
0
Order By: Relevance
“…Here, we term this incomputability as non-Turing computability. Furthermore, there are forms of non-explicit computability, that is non-symbolic computability, such as for artificial neural networks (ANN) and cellular automata (CA) performing emergent computation [19] and dealing with the reality of incomputable real numbers [20]. We consider here the incomputability of imaginary numbers as theoretical incomputability, for which no resolutive procedure is conceivable/admissible, much less a Turing machine.…”
Section: Incomputabilitymentioning
confidence: 99%
“…Here, we term this incomputability as non-Turing computability. Furthermore, there are forms of non-explicit computability, that is non-symbolic computability, such as for artificial neural networks (ANN) and cellular automata (CA) performing emergent computation [19] and dealing with the reality of incomputable real numbers [20]. We consider here the incomputability of imaginary numbers as theoretical incomputability, for which no resolutive procedure is conceivable/admissible, much less a Turing machine.…”
Section: Incomputabilitymentioning
confidence: 99%