The following pages link to G. S. Tsejtin (Q1256318):
Displaying 31 items.
- An upper estimate of the finite-state complexity for a class of generating schemes containing complements and intersections (Q1256319) (← links)
- On upper bounds of recursively enumerable sets of constructive real numbers (Q2551100) (← links)
- Reduced form of normal algorithms and a linear acceleration theorem (Q2557249) (← links)
- Lower estimate of the number of steps for an inverting normal algorithm and other similar algorithms (Q2557250) (← links)
- Another constructive version of the Cauchy theorem (Q2557254) (← links)
- A pseudofundamental sequence that is not equivalent to any monotone sequence (Q2557693) (← links)
- (Q3849891) (← links)
- (Q3849892) (← links)
- (Q3849894) (← links)
- (Q4132437) (← links)
- (Q4182708) (← links)
- (Q5559247) (← links)
- (Q5596798) (← links)
- (Q5604434) (← links)
- (Q5604462) (← links)
- (Q5626613) (← links)
- (Q5626614) (← links)
- (Q5626621) (← links)
- (Q5626622) (← links)
- (Q5626633) (← links)
- Mean value theorems in constructive analysis (Q5633980) (← links)
- On singular coverings and properties of constructive functions connected with them (Q5635433) (← links)
- (Q5636860) (← links)
- (Q5645402) (← links)
- Three theorems on constructive functions (Q5654028) (← links)
- (Q5658077) (← links)
- (Q5661129) (← links)
- A method of presenting the theory of algorithms and enumerable sets (Q5661486) (← links)
- Concerning a generalized principle of constructive selection (Q5661487) (← links)
- (Q5737081) (← links)
- (Q5848898) (← links)