Name
Abstract | ||
|---|---|---|
In the framework of computable topology we investigate properties of partial computable functions, in particular complexity of various problems in computable analysis in terms of index sets, the effective Borel and Lusin hierarchies. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-58741-7_7 | UNVEILING DYNAMICS AND COMPLEXITY, CIE 2017 |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Computability logic,utm theorem,Computability,Rice's theorem,Computable number,Computable function,Mathematics,Computable analysis,Computable topology | Conference | 10307 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.37 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Margarita V. Korovina | 1 | 84 | 15.61 |
| Oleg V. Kudinov | 2 | 105 | 15.85 |