Faculty

Institution

Unit

Venue

Theodore A. Slaman

Professor Emeritus Emeritus Faculty

University of California, Berkeley

Affiliations

College of Letters & Science

Mathematical & Physical Sciences

Mathematics

Theodore A. Slaman is currently serving as a College Of Letters & Science Professor Emeritus Emeritus Faculty at University of California, Berkeley.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Theodore A. Slaman

University of California, Berkeley

Professor Emeritus Emeritus Faculty

You can click a keyword to filter the displayed items

mathematics applied mathematics computational complexity mathematical logic computational complexity theory computer science algorithmic information theory linguistics mathematical analysis computational mathematics number theory applied logic formal methods combinatorics computability theory analytic number theory semantics mathematical sciences logic in computer science turing degrees recursive sets mathematical optimization automated reasoning extremal set theory enumeration degrees classical logic logical formalism turing jump machine learning research higher education digital scholarship measure theory program slicing theoretical analysis theoretical mathematics philosophy of logic symbolic computation atomic model theorem random reals combinatorial principles arithmetic equivalence different bases effective randomness applied linguistics knowledge discovery educational psychology numerical algorithms computational intelligence spectral theory textual practice automated deduction documentation extremophiles belief revision knowledge extraction deception detection digital evidence extraction information theory problem-based learning learning theory test oracle educational theory proof complexity rule induction modern algebra symbolic machine learning symbolic techniques computational number theory temporal complexity non-classical logic generic copies countable structures recursive enumerability nonrecursive set type omitting polynomial-time algorithm reverse mathematics foundation of mathematics recursive function philosophy of mathematics computational model theory recursion theory

Video Presentations

Notable Scholarly Works

Notable Federal Grants

Collaborators

Capacitability for Co-Analytic Sets. New Zealand journal of mathematics (2022)

Theodore Slaman

analytic number theorytheoretical analysispure mathematicstheoretical mathematicsmathematicsco-analytic setsapplied mathematics

Front Matter. The Australian Year Book of International Law Online (2022)

Rachel FergusonSophie QuoyleSuhua ZhangSamuel GormanTamara RichardsonCeleste ZhongBen HuntsmanScott RobinsonAva CadeeJessica TaylorPhilip AlstonChristine ChinkinLaurence Boisson De ChazournesTheodore ChristakisHelen BradyKatrina CooperBill CampbellKaren ScottHilary Charlesworth JudgeGerry SimpsonSimon ChestermanDean Of LawS StrongJemima BackAlistair BoydNiamh CallinanTimothy CollinsJulian EdwardsJoseph HarmanMun LeeCatherine NguyenIbrahim TahaLiuyuwen YangYuanhang WangLara WilkinsonChiara AngeloniAsha BelkinLoretta BensonSulithi DewendraLucinda DunhamKellie ElmesElliot FreadmanMatthew GriceMeg HaynesTristan JamsonCrystal JiKavina KalaichelvamRhiannon KerrRachel KirkEmily LaAlex LiaJake MarusichCaitlyn MckenzieRachel MossEmma NortonKatherine O'connellJayden PayneEmily RowbothamSamuel SaundersDiya Sharma

electronic publishingworld literatureliteratureprelims comprisecontents foreword prefacedigital scholarshipliterary theoryfront mattertextual practicecopyright protectionenglishmedia studies

Effective Randomness for Continuous Measures. Journal of the American Mathematical Society (2021)

Jan ReimannTheodore Slaman

effective randomnesscontinuous measuresmeasure theorymathematicsmathematical analysisprobability theoryapplied mathematicsstatistics

Fragments of the Theory of the Enumeration Degrees. Advances in Mathematics (2021)

Steffen LemppTheodore A. SlamanMariya I. Soskova

analytic number theorycomputational complexitymathematicscomputational mathematicsenumeration degreesnumber theory

The Strength of Ramsey’s Theorem for Pairs and Arbitrarily Many Colors. Journal of Symbolic Logic (2018)

THEODORE A. SLAMANKEITA YOKOYAMA

combinatoricslinguisticsmathematical logiccomputational complexity theorycomputational complexitymathematicsalgorithmic information theory

Aspects of the Turing Jump. Cambridge University Press eBooks (2017)

Theodore A. Slaman

turing machineturing jumpmathematics

Irrationality Exponent, Hausdorff Dimension and Effectivization. Monatshefte für Mathematik (2017)

Verónica BecherJan ReimannTheodore A. Slaman

mathematical logichausdorff dimensioncomputational complexityirrationality exponentmathematics

On Absolutely Normal Numbers and Their Discrepancy Estimate. arXiv (Cornell University) (2017)

Verónica BecherAdrian-Maria ScheererTheodore A. Slaman

time seriesdiscrepancy estimatestatistics

On the Construction of Absolutely Normal Numbers. arXiv (Cornell University) (2017)

Christoph AistleitnerVerónica BecherAdrian-Maria ScheererTheodore Slaman

number theorymathematics

The $\Delta ^0_2$ Turing Degrees: Automorphisms and Definability. Transactions of the American Mathematical Society (2017)

Theodore A. SlamanMariya I. Soskova

computational complexity theorycomputational complexitymathematicscomputational mathematicsalgorithmic information theorynumber theoryapplied mathematics

1
2
3
4
5
12
10 / page

Theodore A. Slaman

Professor Emeritus Emeritus Faculty

University of California, Berkeley

Affiliations

College of Letters & Science

Mathematical & Physical Sciences

Mathematics

Theodore A. Slaman is currently serving as a College Of Letters & Science Professor Emeritus Emeritus Faculty at University of California, Berkeley.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Theodore A. Slaman

University of California, Berkeley

Professor Emeritus Emeritus Faculty

You can click a keyword to filter the displayed items

Video Presentations

Notable Scholarly Works

Notable Federal Grants

Collaborators

Capacitability for Co-Analytic Sets. New Zealand journal of mathematics (2022)

Theodore Slaman

analytic number theorytheoretical analysispure mathematicstheoretical mathematicsmathematicsco-analytic setsapplied mathematics

Front Matter. The Australian Year Book of International Law Online (2022)

electronic publishingworld literatureliteratureprelims comprisecontents foreword prefacedigital scholarshipliterary theoryfront mattertextual practicecopyright protectionenglishmedia studies

Effective Randomness for Continuous Measures. Journal of the American Mathematical Society (2021)

Jan ReimannTheodore Slaman

effective randomnesscontinuous measuresmeasure theorymathematicsmathematical analysisprobability theoryapplied mathematicsstatistics

Fragments of the Theory of the Enumeration Degrees. Advances in Mathematics (2021)

Steffen LemppTheodore A. SlamanMariya I. Soskova

analytic number theorycomputational complexitymathematicscomputational mathematicsenumeration degreesnumber theory

The Strength of Ramsey’s Theorem for Pairs and Arbitrarily Many Colors. Journal of Symbolic Logic (2018)

THEODORE A. SLAMANKEITA YOKOYAMA

combinatoricslinguisticsmathematical logiccomputational complexity theorycomputational complexitymathematicsalgorithmic information theory

Aspects of the Turing Jump. Cambridge University Press eBooks (2017)

Theodore A. Slaman

turing machineturing jumpmathematics

Irrationality Exponent, Hausdorff Dimension and Effectivization. Monatshefte für Mathematik (2017)

Verónica BecherJan ReimannTheodore A. Slaman

mathematical logichausdorff dimensioncomputational complexityirrationality exponentmathematics

On Absolutely Normal Numbers and Their Discrepancy Estimate. arXiv (Cornell University) (2017)

Verónica BecherAdrian-Maria ScheererTheodore A. Slaman

time seriesdiscrepancy estimatestatistics

On the Construction of Absolutely Normal Numbers. arXiv (Cornell University) (2017)

Christoph AistleitnerVerónica BecherAdrian-Maria ScheererTheodore Slaman

number theorymathematics

The $\Delta ^0_2$ Turing Degrees: Automorphisms and Definability. Transactions of the American Mathematical Society (2017)

Theodore A. SlamanMariya I. Soskova

computational complexity theorycomputational complexitymathematicscomputational mathematicsalgorithmic information theorynumber theoryapplied mathematics

1
2
3
4
5
12
10 / page

Similar Faculty Members

Yiannis N. Moschovakis

Institution

University of California, Los Angeles

philosophy of language

philosophical logic

Antonio Montalban

Institution

University of California, Berkeley

mathematics

applied mathematics

John R. Steel

Institution

University of California, Berkeley

foundation of mathematics

set theory

Stephen G. Simpson

Institution

Pennsylvania State University

mathematical logic

automated deduction

Harvey Friedman

Institution

Ohio State University

philosophy

general system

Jeremy Avigad

Institution

Carnegie Mellon University

mathematical logic

formal verification

Peter Cholak

Institution

University of Notre Dame

extremal set theory

discrete algorithm

Stephen G. Simpson

Institution

Vanderbilt University

mathematical logic

applied logic

Anand Pillay

Institution

University of Notre Dame

applied mathematical modelling

scientific computing

Dejan Slepčev

Institution

Carnegie Mellon University

numerical mathematics

general systems

Similar Faculty Members

Yiannis N. Moschovakis

Institution

University of California, Los Angeles

philosophy of language

philosophical logic

Antonio Montalban

Institution

University of California, Berkeley

mathematics

applied mathematics

John R. Steel

Institution

University of California, Berkeley

foundation of mathematics

set theory

Stephen G. Simpson

Institution

Pennsylvania State University

mathematical logic

automated deduction

Harvey Friedman

Institution

Ohio State University

philosophy

general system

Jeremy Avigad

Institution

Carnegie Mellon University

mathematical logic

formal verification

Peter Cholak

Institution

University of Notre Dame

extremal set theory

discrete algorithm

Stephen G. Simpson

Institution

Vanderbilt University

mathematical logic

applied logic

Anand Pillay

Institution

University of Notre Dame

applied mathematical modelling

scientific computing

Dejan Slepčev

Institution

Carnegie Mellon University

numerical mathematics

general systems