Search

Your search keyword '"Mycka, J"' showing total 31 results
Start Over Author "Mycka, J"
31 results on '"Mycka, J"'

19. A foundation for real recursive function theory

Author

Costa, J.F., Loff Barreto, Bruno Serra, Mycka, J., and Quantum Computing and Advanced System Research

Subjects
Infinite limits, Computability on reals, Differential recursion, Real recursive functions
Abstract

The class of recursive functions over the reals, denoted by REC(R), was introduced by Cristopher Moore in his seminal paper written in 1995. Since then many subsequent investigations brought new results: the class REC(R) was put in relation with the class of functions generated by the General Purpose Analogue Computer of Claude Shannon; classical digital computation was embedded in several ways into the new model of computation; restrictions of REC(R) were proved to represent different classes of recursive functions, e.g., recursive, primitive recursive and elementary functions, and structures such as the Ritchie and the Grzergorczyk hierarchies. The class of real recursive functions was then stratified in a natural way, and REC(R) and the analytic hierarchy were recently recognised as two faces of the same mathematical concept. In this new article, we bring a strong foundational support to the Real Recursive Function Theory, rooted in Mathematical Analysis, in a way that the reader can easily recognise both its intrinsic mathematical beauty and its extreme simplicity. The new paradigm is now robust and smooth enough to be taught. To achieve such a result some concepts had to change and some new results were added.

Published
2009

30. The Euclid abstract machine

Author

Mycka, J., Costa, J. F., and Francisco Coelho

Subjects
Computation, Geometry
Abstract

Concrete non-computable functions are usually related to the halting function. Is it possible to present examples of non-computability, which are unrelated to the halting problem and its derivatives? We built an abstract machine based on the historic concept of compass and ruler constructions (a compass construction would suffice) which reveals the existence of non-computable functions not related with the halting problem. These natural, and the same time, non-computable functions can help to understand the nature of the uncomputable and the purpose, the goal, and the meaning of computing beyond Turing.

Catalog

Books, media, physical & digital resources
See catalog results