2 ms·
Interesting article! You may also be interested in Computability Logic [1]: > Computability Logic (CoL) understands computational problems in their most genera
by naasking 8y ago
Interesting article! You may also be interested in Computability Logic [1]:
> Computability Logic (CoL) understands computational problems in their most general – interactive sense. [...] CoL provides a generalization of the Church-Turing thesis to the interactive level. The classical concept of truth turns out to be a special, zero-interactivity-degree case of computability. This makes classical logic a special fragment of CoL. Being a conservative extension of the former, computability logic is, at the same time, by an order of magnitude more expressive, constructive and computationally meaningful.
[1] https://en.wikipedia.org/wiki/Computability_logic https://en.wikipedia.org/wiki/Computability_logic