The following pages link to Marian Boykan Pour-El (Q1054722):
Displaying 28 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)
- Computability and Noncomputability in Classical Analysis (Q3657990) (← links)
- A computable ordinary differential equation which possesses no computable solution (Q3859258) (← links)
- (Q3994907) (← links)
- Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers) (Q4049052) (← links)
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable (Q4085712) (← links)
- (Q4180346) (← links)
- The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable (Q4366130) (← links)
- (Q4531978) (← links)
- (Q4934288) (← links)
- A Recursion-theoretic View of Axiomatizable Theories (Q5181336) (← links)
- Computability in Analysis and Physics (Q5274810) (← links)
- A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION (Q5341752) (← links)
- Godel Numberings Versus Friedberg Numberings (Q5554965) (← links)
- Deduction-preserving "Recursive Isomorphisms" between theories (Q5561954) (← links)
- Deduction-preserving “recursive isomorphisms” between theories (Q5561955) (← links)
- Effectively extensible theories (Q5569450) (← links)
- Independent Axiomatization and its Relation to the Hypersimple Set (Q5573361) (← links)
- “Recursive isomorphism” and effectively extensible theories (Q5608005) (← links)
- Axiomatizable theories with few axiomatizable extensions (Q5609359) (← links)
- Recursively enumerable classes and their application to recursive sequences of formal theories (Q5652663) (← links)
