Dependence relations in computably rigid computable vector spaces (Q703839)

A computable vector space \(V\) is said to be computably rigid if all its computable automorphisms map every one-dimensional subspace of \(V\) into itself. A dependence algorithm for a vector space takes as input a finite set of vectors and decides whether they are linearly dependent or not. The paper constructs a computably rigid computable vector space for which the dependency algorithm has an arbitrary high c.e. Turing degree.