Dependence relations in computably rigid computable vector spaces (Q703839)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2126479
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dependence relations in computably rigid computable vector spaces |
scientific article; zbMATH DE number 2126479 |
Statements
Dependence relations in computably rigid computable vector spaces (English)
0 references
11 January 2005
0 references
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.
0 references
computable vector spaces
0 references
dependence algorithm
0 references
computable automorphism groups
0 references
0.7500653266906738
0 references
0.7391142845153809
0 references
0.720946729183197
0 references
0.7125099301338196
0 references
