Marian Boykan Pour-El

According to our database, Marian Boykan Pour-El authored at least 10 papers between 1968 and 2000.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2000

The Degree of Unsolvability of a Real Number.

Anthony J. Dunlop, Marian Boykan Pour-El

Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999

From Axiomatics to Intrinsic Characterization: Some Open Problems in Computable Analysis.

Marian Boykan Pour-El

Theor. Comput. Sci., 1999

The Structure of Computability in Analysis and Physical Theory.

Marian Boykan Pour-El

Proceedings of the Handbook of Computability Theory, 1999

1997

The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable.

Marian Boykan Pour-El, Ning Zhong

Math. Log. Q., 1997

1989

Computability in analysis and physics.

Marian Boykan Pour-El, Jonathan Ian Richards

Perspectives in Mathematical Logic, Springer, ISBN: 978-3-540-50035-3, 1989

1978

Differentiability properties of computable functions - a summary.

Marian Boykan Pour-El, I. Richards

Acta Cybern., 1978

Computer Science And Recursion Theory.

Marian Boykan Pour-El

Proceedings of the Proceedings 1978 ACM Annual Conference, 1978

1975

On a simple definition of computable function of a real variable-with applications to functions of a complex variable.

Marian Boykan Pour-El, Jerome Caldwell

Math. Log. Q., 1975

1970

Axiomatizable Theories with Few Axiomatizable Extensions.

Donald A. Martin, Marian Boykan Pour-El

J. Symb. Log., 1970

1968

Effectively Extensible Theories.

Marian Boykan Pour-El

J. Symb. Log., 1968