Results 1 -
2 of
2
POLISH GROUP ACTIONS AND COMPUTABILITY
, 903
"... ABSTRACT 1 2 Let G be a closed subgroup of S ∞ and X be a Polish G-space with a countable basis A of clopen sets. Each x ∈ X defines a characteristic function τx on A by τx(A) = 1 ⇔ x ∈ A. We consider computable complexity of τx and some related questions. 1. ..."
Abstract
- Add to MetaCart
ABSTRACT 1 2 Let G be a closed subgroup of S ∞ and X be a Polish G-space with a countable basis A of clopen sets. Each x ∈ X defines a characteristic function τx on A by τx(A) = 1 ⇔ x ∈ A. We consider computable complexity of τx and some related questions. 1.
POLISH GROUP ACTIONS AND COMPUTABILITY
, 903
"... ABSTRACT. Let G be a closed subgroup of S ∞ and X be a Polish G-space with a countable basis A of clopen sets. Each x ∈ X defines a characteristic function τx on A by τx(A) = 1 ⇔ x ∈ A. We consider computable complexity of τx and some related questions. 1. ..."
Abstract
- Add to MetaCart
ABSTRACT. Let G be a closed subgroup of S ∞ and X be a Polish G-space with a countable basis A of clopen sets. Each x ∈ X defines a characteristic function τx on A by τx(A) = 1 ⇔ x ∈ A. We consider computable complexity of τx and some related questions. 1.
