Marian Boykan Pour-El

Available identifiers

zbMath Open pour-el.marian-boykanWikidataQ60845458 ScholiaQ60845458MaRDI QIDQ1054722

List of research outcomes

Publication	Date of Publication	Type
Computability in Analysis and Physics	2017-07-06	Paper
https://portal.mardi4nfdi.de/entity/Q4531978	2002-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q4934288	2000-10-08	Paper
From axiomatics to intrinsic characterization: some open problems in computable analysis	1999-06-21	Paper
The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable	1997-11-18	Paper
https://portal.mardi4nfdi.de/entity/Q3994907	1992-09-17	Paper
The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not	1987-01-01	Paper
L p -Computability in Recursive Analysis	1984-01-01	Paper
Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators	1983-01-01	Paper
Computability and Noncomputability in Classical Analysis	1983-01-01	Paper
Noncomputability in models of physical phenomena	1982-01-01	Paper
The wave equation with computable initial data such that its unique solution is not computable	1981-01-01	Paper
A computable ordinary differential equation which possesses no computable solution	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4180346	1978-01-01	Paper
On a simple definition of computable function of a real variable‐with applications to functions of a complex variable	1975-01-01	Paper
Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3214915	1973-01-01	Paper
A Recursion-theoretic View of Axiomatizable Theories	1970-01-01	Paper
Axiomatizable theories with few axiomatizable extensions	1970-01-01	Paper
Effectively extensible theories	1968-01-01	Paper
Independent Axiomatization and its Relation to the Hypersimple Set	1968-01-01	Paper
Deduction-preserving "Recursive Isomorphisms" between theories	1967-01-01	Paper
Deduction-preserving “recursive isomorphisms” between theories	1967-01-01	Paper
“Recursive isomorphism” and effectively extensible theories	1965-01-01	Paper
Recursively enumerable classes and their application to recursive sequences of formal theories	1965-01-01	Paper
A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION	1964-01-01	Paper
Godel Numberings Versus Friedberg Numberings	1964-01-01	Paper
A Comparison of Five “Computable” Operators	1960-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

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