The following pages link to Marian Boykan Pour-El (Q1054722):
Displaying 12 items.
- Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators (Q1054723) (← links)
- The wave equation with computable initial data such that its unique solution is not computable (Q1154609) (← links)
- Noncomputability in models of physical phenomena (Q1168502) (← links)
- From axiomatics to intrinsic characterization: some open problems in computable analysis (Q1292411) (← links)
- The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not (Q1821332) (← links)
- (Q3214915) (← links)
- L p -Computability in Recursive Analysis (Q3222841) (← links)
- A Comparison of Five “Computable” Operators (Q3273300) (← links)
- A Recursion-theoretic View of Axiomatizable Theories (Q5181336) (← links)
- A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION (Q5341752) (← links)
- Deduction-preserving "Recursive Isomorphisms" between theories (Q5561954) (← links)
- Independent Axiomatization and its Relation to the Hypersimple Set (Q5573361) (← links)
