23 citations · 23 across the 1 of their papers we have counts for
2 papers
math.LO2026
Uniform Computability of Isotypic Block Diagonalization for Finite-Group Representations
Konrad Burnik
We study the universal isotypic block-diagonalization problem in the Type-2 theory of effectivity (TTE). We obtain a uniform computability result for the universal block diagonaliz…
cs.LO2014★ 23 cited
Computability of 1-manifolds
Konrad Burnik, Zvonko Iljazovic
A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable.…