Examples: Prince; Princeton University; Ken Follett; Follett,Ken
1shortlisttitle datasearch history  
results search [or] (ISNI Number (ISN:)) 0000000109215209 | 1 hits
Person
ISNI: 
0000 0001 0921 5209
Name: 
Davis, Martin,
Davis, Martin D.
Devis, M.
Девис, М
Девис, Мартин
デービス, M
ディヴィス, マーティン
Dates: 
1928-
Creation class: 
cre
Language material
Text
Creation role: 
author
creator
editor
redactor
Related names: 
Hausner, Melvin (fl. 1965)
Landau, Edmund
Matiâsevič, Ûrij Vladimirovič
Post, Emil Leon (1897-1954)
Princeton University
Schreier, Otto (1901-1929))
Sigal, Ron
Sperner, Emanuel (1905-1980))
Uspenskij, Vladimir Andreevič
Weyuker, Elaine J.
難波, 完爾 (1939-)
Titles: 
Alan M. Turing : centenary edition
Applied nonstandard analysis
Astrolocality astrology : a guide to what it is and how to use it
Chōjun kaiseki
Computability, 1973-1974
Computability, complexity, and languages, 1983:
Computability, complexity, and languages : fundamentals of theoretical computer sciences
Computability complexity and languages fundamentals of theorical computer science
computability, complexity, and languages, second edition: fundamentals of theoretical computer science
Computability & unsolvability
Computadora universal, La : de Leibniz a Turing
Computational logic and set theory : applying formalized logic to analysis
Desâtaâ problema Gil'berta
Desiataia problema Gil'berta
Differential and integral calculus, by Edmund Landau,... Translated from the German by Melvin Hausner and Martin Davis...
Einführung in die Differentialrechnung und Integralrechnung
Engines of logic : mathematicians and the origin of the computer
first course in functional analysis, A
From here to there : an astrologer's guide to astromapping
Hilbert's tenth problem
Incunabula : studies in fifteenth-century printed books presented to Lotte Hellinga
Introduction to modern algebra and matrix theory
Julia Robinson and Hilbert's tenth problem
Keisan no riron
Lectures on modern mathematics : fundamentals of theorical computer science
On the theory of recursive unsolvability
Prikladnoj nestandartnyj analiz
Set theory and the continuum hypothesis
Solvability, provability, definability the collected works of Emil L. Post
Sūgakugirai no tameno konpyūta ronrigaku : Nandemo keisan ni naru konpon genri
undecidable; basic papers on undecidable propositions, unsolvable problems and computable functions., The
universal computer, The : the road from Leibniz to Turing
Works.
Прикладной нестандартный анализ, 1980:
数学嫌いのためのコンピュータ論理学 : 何でも「計算」になる根本原理
計算の理論
超準解析
Notes: 
Thèse--Princeton University
Sources: 
VIAF BNC BNE BNF DNB LC LNB NDL NKC NLI NTA NUKAT SUDOC WKP
TEL