LabCompass

Peter Gerdes

Computer Science · Indiana University

OpenAlex ORCID
Computability, Logic, AI AlgorithmsAdvanced Topology and Set Theorysemigroups and automata theoryAdvanced Algebra and LogicCellular Automata and Applications

Publications

25

Citations

133

Est. group size

—

Recurring co-author estimate

Active years

59

Publishing since 1967

Research summary
AI-generated

Peter Gerdes works in mathematical logic and computability theory, a branch of theoretical computer science that studies what problems can in principle be solved by computation and how the difficulty of unsolvable problems can be classified. His work involves formal structures such as degrees of computability, arithmetic hierarchies, and related notions of how information can be encoded and compared. This is a highly abstract, proof-oriented area rather than applied or software-focused research.

Computability theoryMathematical logicDegrees of unsolvability and arithmetic degreesSet theory and infinite structuresAutomata and algebraic logic

Publication activity has been low and roughly steady over the past several years, averaging under one paper per year with a brief peak in 2021.

Generated by claude-opus-4-8 from public bibliographic data · Jul 11, 2026

Publication cadence
Publications per year over the last 10 years — averaging 0.8/year recently
17182019: 2 publications19202021: 4 publications4212022: 1 publication222023: 1 publication232024: 1 publication242025: 1 publication2526
Recent publications
Publishes in
  • arXiv (Cornell University)×4
  • Computability×2
  • Zenodo (CERN European Organization for Nuclear Research)×1
  • Logic Journal of IGPL×1
  • Journal of Symbolic Logic×1

This profile was generated automatically from public scholarly data (OpenAlex). Group size and activity levels are estimates derived from co-authorship patterns.

Last updated Jul 11, 2026.

Claim or correct this profile