New answers tagged reference-request
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 ...
- 547
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.
- 213
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.
- 10.5k
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
Related Tags
reference-request × 1559cc.complexity-theory × 339
ds.algorithms × 238
graph-theory × 189
graph-algorithms × 103
co.combinatorics × 86
np-hardness × 73
lo.logic × 72
fl.formal-languages × 68
approximation-algorithms × 65
complexity-classes × 63
optimization × 63
automata-theory × 62
pl.programming-languages × 62
soft-question × 56
computability × 53
cg.comp-geom × 50
big-list × 47
machine-learning × 46
circuit-complexity × 45
quantum-computing × 44
lg.learning × 38
big-picture × 35
type-theory × 33
ds.data-structures × 32