New answers tagged

6 votes

Relationship between the transition monoid of an automaton and its adjacency matrix

The algebraic view has many useful properties. I think these become more evident when you move from the Boolean setting to richer semirings, e.g., tropical-weighted automata. At any rate, a celebrated ...
  • 5,491
1 vote

Is there any book on the philosophical implications of Theoretical Computer Science?

As far as I know, there is no book dedicated exclusively to philosophical implications of theoretical computer science. However, there is some philosophical work done around complexity theory and ...
2 votes

Is there any book on the philosophical implications of Theoretical Computer Science?

I highly recommend Pudlak's Logical Foundations of Mathematics and Computational Complexity.
2 votes

Is there any book on the philosophical implications of Theoretical Computer Science?

The Philosophy of Computer Science, in the Stanford Encyclopedia of Philosophy: https://plato.stanford.edu/entries/computer-science/ with an interesting bibliography.
8 votes
Accepted

Stronger "induction" principles than induction-recursion

Anton Setzer has work on type theories that are stronger than standard induction-recursion. In some ways, though, it's still in terms of simultaneous inductive and recursive definitions. The ...
  • 814

Top 50 recent answers are included