Computable analysis /

Computable analysis /

41

Bibliographic Details
Main Author:	367053 Aberth, Oliver
Format:
Published:	New York : MvGraw-Hill, 1980
Subjects:	Recursion theory Mathematical analysis

Similar Items

E-recursively enumerable degrees
by: Griffor, Edward R.
Published: (2005)

Computability theory : an introduction to recursion theory /
by: 461543 Enderton, Herbert B.
Published: (c201)

Introduction to precise numerical methods [compact dsic] /
by: 367053 Aberth, Oliver
Published: (2007)

Introduction to precise numerical methods /
by: 367053 Aberth, Oliver
Published: (2007)

Generalized recursion theory II /
by: Symposium on Generalized Recursion Theory (2nd: 1977: University of Oslo), et al.
Published: (1978)

Recursion-theoretic hierarchies /
by: 366611 Hinman, Peter G.
Published: (1978)

Thinking recursively /
by: 203886 Roberts, Eric
Published: (1986)

The Kleene symposium: proceedings of the symposium held June 18-24, 1978 at Madison, Wisconsin, U.S.A. /
by: Kleene Symposium (1978 : University of Wisconsin-Madison), et al.
Published: (1980)

Computability : an introduction to recursive function theory /
by: 367112 Cutland, Nigel
Published: (1980)

Introduction to computability /
by: 430261 Hennie, Frederick C.
Published: (1977)

Computability and unsolvability /
by: 429964 Davis, Martin
Published: (1958)

Computations in higher types /
by: 430417 Moldestad, Johan
Published: (1977)

Theory of recursive functions and effective computability /
by: 430645 Rogers, Hartley
Published: (1967)

Algorithm design : a recursion transformation framework /
by: 258995 Paull, Marvin C.
Published: (c198)

Enumerability, decidability, computability : an introduction to the theory of recursive functions /
by: 430372 Hermes, Hans
Published: (1969)

Computability and logic /
by: 386993 Boolos, George, et al.
Published: (1974)

Computability
by: 8545 Open University. Computing and Computers Course Team
Published: (1973)

Theory of computation /
by: Kozen, Dexter, 1951-
Published: (2006)

You can have all of the numbers all of the time [filem]
Published: (1972)

You can have all of the numbers all of the time [kasetvideo]
Published: (1972)

Fundamentals of mathematical logic /
by: 366611 Hinman, Peter G.
Published: (2005)

Constructive order types /
by: 436319 Crossley, John N.
Published: (1969)

Regressive sets and the theory of isols /
by: 182336 Mclaughlin, Thomas G.
Published: (1982)

The foundations of intuitionistic mathematics, especially in relation to recursive functions /
by: 308908 Kleene, Stephen Cole
Published: (1965)

Compiler-based prefetching algorithm for recuresive data structure /
by: 236228 Nurulhaini Anuar
Published: (2007)

Compiler-based prefetching algorithm for recuresive data structure [electronic resource] /
by: 236228 Nurulhaini Anuar
Published: (2007)

Recursiveness /
by: 430157 Eilenberg, Samuel
Published: (1970)

Recursive functions /
by: 430594 Peter, Rozsa
Published: (1967)

Degrees of unsolvability /
by: 430728 Sacks, Gerald E.
Published: (1966)

Generalized recursion theory
Published: (1974)

Introduction to the theory of computation /
by: 460476 Engeler, Erwin
Published: (1973)

Computability and logic /
by: 386993 Boolos, George, et al.
Published: (1989)

The undecidable : basic papers on undecidable propositions, unsolvable problems and computable functions /
by: 429964 Davis, Martin
Published: (1965)

Recursion on inadmissible ordinals
by: Friedman, Sy David
Published: (2005)

How to think about algorithms /
by: Edmonds, Jeff, 1963-
Published: (2008)

Minimun degree of the unsolvability and the full approximation construction /
by: Epstein, Richard L.
Published: (1975)

Punctual categoricity and universality
by: Downey, Rod, et al.
Published: (2022)

Danish Stød in Compounds: A Stratal Match Theory Analysis
by: Yonatan Goldshtein
Published: (2025-02-01)

The Diversity of Categoricity Without Delay
by: Kalimullin, I. S., et al.
Published: (2017)

Stable recursions : with applications to the numerical solution to stiff systems /
by: 239720 Cash, J. R.
Published: (1979)