Marian Pour-El

Q: What Schools Are Affiliated With Marian Pour-El

Marian Pour-El is affiliated with the following schools: University of California, Berkeley, Hunter College, Pennsylvania State University, Harvard University

Marian Pour-El's AcademicInfluence.com Rankings

Marian Pour-El

Mathematics

#5364

World Rank

#7554

Historical Rank

Measure Theory

#3487

World Rank

#4113

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Marian Pour-El's Degrees

PhD Mathematics University of California, Berkeley

Why Is Marian Pour-El Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Marian Boykan Pour-El was an American mathematical logician who did pioneering work in computable analysis. Early life and education Marian Boykan was born in 1928 in New York City; her parents were dentist Joseph Boykan and his wife Matilda , a former laboratory technician and housewife. As a young girl, she performed ballet at the Metropolitan Opera House, and this influenced her later life where she was often more comfortable speaking before large audiences than in small groups. Although she wanted to attend the Bronx High School of Science, it was at that time only for boys; instead, she went to a girls' school, Hunter College High School.

(See a Problem?)

Marian Pour-El's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Computability in analysis and physics (1989) (914)
The wave equation with computable initial data such that its unique solution is not computable (1981) (229)
Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers) (1974) (170)
COMPUTABILITY AND NONCOMPUTABILITY IN CLASSICAL ANALYSIS (1983) (70)
The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable (1996) (60)
Deduction-preserving "Recursive Isomorphisms" between theories (1967) (55)
Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators (1983) (54)
Noncomputability in models of physical phenomena (1982) (50)
On a simple definition of computable function of a real variable-with applications to functions of a complex variable (1975) (50)
An Introduction to Computable Analysis (1989) (41)
Review: Robert I. Soare, Recursively enumerable sets and degrees: A study of computable functions and computably generated sets (1988) (38)
Axiomatizable theories with few axiomatizable extensions (1970) (37)
A Comparison of Five “Computable” Operators† (1960) (24)
Recursively enumerable classes and their application to recursive sequences of formal theories (1965) (23)
Review: Gerald E. Sacks, On the Degrees Less than 0' (1964) (20)
Gödel numberings versus Friedberg numberings (1964) (19)
The Degree of Unsolvability of a Real Number (2000) (17)
A structural criterion for recursive enumeration without repetition (1964) (15)
Review: Richard M. Friedberg, Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration Without Duplication (1960) (14)
Chapter 13 - The Structure of Computability in Analysis and Physical Theory: An Extension of Church's Thesis (1999) (12)
Lp-COMPUTABILITY IN RECURSIVE ANALYSIS (1984) (10)
MATHEMATICIAN (1973) (9)
Effectively Extensible Theories (1968) (8)
Review: Richard M. Friedberg, A Criterion for Completeness of Degrees of Unsolvability (1960) (8)
Deduction-preserving “recursive isomorphisms” between theories (1967) (7)
Differentiability properties of computable functions - a summary (1978) (7)
The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not (1987) (6)
Review: Richard Friedberg, Un Contre-Exemple Relatif aux Fonctionnelles Recursives (1959) (6)
Independent Axiomatization and its Relation to the Hypersimple Set (1968) (5)
“Recursive isomorphism” and effectively extensible theories (1965) (5)
Spatial Separation in Family Life: A Mathematician’s Choice (1981) (2)
From Axiomatics to Intrinsic Characterization: Some Open Problems in Computable Analysis (1999) (2)
Computer Science And Recursion Theory (1978) (1)
Chapter 3: The First Main Theorem and Its Applications (1989) (1)
Degrees of Unsolvability. Gerald E. Sacks. Princeton University Press, Princeton, N.J., 1963. xii + 174 pp. Illus. Paper, $3.50 (1964) (1)
Abstract computability versus analog-generability (a survey) (1973) (1)
Friedberg Richard. Un contre-exemple relatif aux fonctionnelles récursives. Comptes rendus hebdomadaires des séances de l'Académie des Sciences (Paris), vol. 247 (1958), pp. 852–854. (1959) (1)
Boone William W.. Partial results regarding word problems and recursively enumerable degrees of unsolvability. Bulletin of the American Mathematical Society, vol. 68 (1962), pp. 616–623. (1963) (0)
Friedberg Richard. The uniqueness of finite division for recursive equivalence types. Mathematische Zeitschrift , vol. 75 (1961), pp. 3–7. (1960) (0)
Addendum: Open Problems (1989) (0)
The Second Main Theorem, the Eigenvector Theorem, and Related Results (1989) (0)
Sacks Gerald E.. On the degrees less than 0′. Annals of mathematics, second series, vol. 77 (1963), pp. 211–231.Sacks Gerald E.. Correction to “On the degrees less than 0′.” Annals of mathematics, second series, vol. 78 (1963), p. 204. (1964) (0)
Further Topics in Computable Analysis (1989) (0)
A Recursion‐theoretic View of Axiomatizable Theories (1970) (0)
The First Main Theorem and Its Applications (1989) (0)
Proof of the Second Main Theorem (1989) (0)
Chapter 4: The Second Main Theorem, the Eigenvector Theorem, and Related Results (1989) (0)
Preface to the Series Perspectives in Mathematical Logic (2016) (0)
Prerequisites from Logic and Analysis (1989) (0)
Review: William W. Boone, Partial Results Regarding Word Problems and Recursively Enumerable Degrees of Unsolvability (1963) (0)
Chapter 1: Further Topics in Computable Analysis (1989) (0)
Chapter 5: Proof of the Second Main Theorem (1989) (0)
Successful women in the sciences: an analysis of determinants. I. Individual life experiences. Mathematician. (1973) (0)
Computability Structures on a Banach Space (1989) (0)
Review: J. S. Ullian, Splinters of Recursive Functions (1966) (0)
Chapter 2: Computability Structures on a Banach Space (1989) (0)
Book Review: Complexity theory of real functions (1993) (0)
American Mathematical Society Edited by with the Cooperation of Index to Volume 15 [december Cohomology of Groups in Arbitrary Categories (0)
Mathematics: Degrees of Unsolvability . Gerald E. Sacks. Princeton University Press, Princeton, N.J., 1963. xii + 174 pp. Illus. Paper, $3.50. (1964) (0)
Chapter 0: An Introduction to Computable Analysis (1989) (0)
The Structure of Computability in Analysis and Physical Theory (1999) (0)
"RECURSIVE ISOMORPHISM» AND EFFECTIVELY EXTENSIBLE THEORIES 1 (2007) (0)
THREE THEOREMS ON THE COMPUTABILITY OF LINEAR OPERATORS THEIR EIGENVALUES AND EIGENVECTORS(Logic and the Foundations of Mathematics) (1986) (0)
Review: Richard Friedberg, The Uniqueness of Finite Division for Recursive Equivalence Types (1960) (0)

This paper list is powered by the following services:

Other Resources About Marian Pour-El

en.wikipedia.org

What Schools Are Affiliated With Marian Pour-El?

Marian Pour-El is affiliated with the following schools:

Marian Pour-El's Academic­Influence.com Rankings