Marian Boykan Pour-El

From MaRDI portal
Person:1054722

Available identifiers

zbMath Open pour-el.marian-boykanWikidataQ60845458 ScholiaQ60845458MaRDI QIDQ1054722

List of research outcomes





PublicationDate of PublicationType
Computability in analysis and physics2017-07-06Paper
https://portal.mardi4nfdi.de/entity/Q45319782002-05-27Paper
https://portal.mardi4nfdi.de/entity/Q49342882000-10-08Paper
From axiomatics to intrinsic characterization: some open problems in computable analysis1999-06-21Paper
The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable1997-11-18Paper
https://portal.mardi4nfdi.de/entity/Q39949071992-09-17Paper
The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not1987-01-01Paper
L p -Computability in Recursive Analysis1984-01-01Paper
Computability and Noncomputability in Classical Analysis1983-01-01Paper
Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators1983-01-01Paper
Noncomputability in models of physical phenomena1982-01-01Paper
The wave equation with computable initial data such that its unique solution is not computable1981-01-01Paper
A computable ordinary differential equation which possesses no computable solution1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41803461978-01-01Paper
On a simple definition of computable function of a real variable‐with applications to functions of a complex variable1975-01-01Paper
Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32149151973-01-01Paper
Axiomatizable theories with few axiomatizable extensions1970-01-01Paper
A Recursion-theoretic View of Axiomatizable Theories1970-01-01Paper
Independent Axiomatization and its Relation to the Hypersimple Set1968-01-01Paper
Effectively extensible theories1968-01-01Paper
Deduction-preserving "Recursive Isomorphisms" between theories1967-01-01Paper
Deduction-preserving “recursive isomorphisms” between theories1967-01-01Paper
Recursively enumerable classes and their application to recursive sequences of formal theories1965-01-01Paper
“Recursive isomorphism” and effectively extensible theories1965-01-01Paper
Godel Numberings Versus Friedberg Numberings1964-01-01Paper
A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION1964-01-01Paper
A Comparison of Five “Computable” Operators1960-01-01Paper

Research outcomes over time

This page was built for person: Marian Boykan Pour-El