Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Mycka J.

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Recursively enumerable sets and well-ordering of their enumerations

Mycka J.

Reports on Mathematical Logic

2014

Vol. 49

79--97

We will introduce the special kind of the order relations into recursively enumerable sets and prove that they can be used to distinguish (albeit in a non-constructive way) between recursive and non-recursive sets.

A simple observation regarding iterations of finite-valued polynomial-time functions

Mycka J.

Reports on Mathematical Logic

2009

Vol. 44

19-29

Real Recursive Functions and Baire Classes

Mycka J.

Fundamenta Informaticae

2005

Vol. 65, nr 3

263--278

Recursive functions over the reals [6] have been considered, first as a model of analog computation, and second to obtain analog characterizations of classical computational complexity classes [2]. However, one of the operators introduced in the seminal paper by Cris Moore (in 1996), the minimalization operator, creates some difficulties: (a) although differential recursion (the analog counterpart of classical recurrence) is, to some extent, directly implementable in the General Purpose Analog Computer of Claude Shannon, analog minimalization is far from physical realizability, and (b) analog minimalization was borrowed from classical recursion theory and does not fit well the analytic realm of analog computation. In this paper we use the most natural operator captured from Analysis - the operator of taking a limit - instead of the minimalization with respect to the equivalance of these operators given in [8]. In this context the natural question about coincidence between real recursive functions and Baire classes arises. To solve this problem the limit hierarchy of real recursive funcions is introduced. Relations between Baire classes, effective Baire classes and the limit hierachy are also studied.