Skip to main content

Questions tagged [philosophy]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
0 votes
1 answer

Is there a generalized SAT problem for higher-order logics?

The SAT problem is based upon Boolean expressions, but is there a generalized SAT problem based upon higher order logics?
Geremia's user avatar
  • 111
0 votes
0 answers

What is Shutt abstractiveness?

In software development, there is a pre-formal notion of abstraction. Several attempts have been made to formalize it. In particular, what is Shutt abstraction, or Shutt abstractiveness, and how does ...
Corbin's user avatar
  • 271
5 votes
1 answer

In the age of powerful AI, can all software be written using only tests?

I have no idea where to ask this question, so I am asking it here. Is it possible, that in the near future, there would be a shift in the way we write code, where programmers instead of writing the ...
Maciej Bledkowski's user avatar
-5 votes
1 answer

Does a rock falling down a hill perform computation?

Imagine a rock in the shape of a chessboard with pieces in a certain configuration. Throw the rock down a particular hill. The hill is shaped in such a way that, given the correct throw, the ...
MeltyButter's user avatar
3 votes
4 answers

Philosophy behind monotonicity requirement for inductive types

Is there a good philosophical reason for why inductive types with negative occurrences or non-monotonicity should not be considered valid constructions? According to my understanding of the Bishop/...
user181407's user avatar
20 votes
12 answers

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

I find some books about computers, but all of them are about technology. I want something more linked to theory.
Raphael Augusto's user avatar
8 votes
1 answer

About the origin of the names "immune" and "simple"

I have been wondering for a while about the origin of the names "immune" and "simple". I also posed the same question to Andrea Sorbi, who in turn involved a few more colleagues in the discussion. ...
Andrea Asperti's user avatar
-1 votes
1 answer

Understanding between lambda-calculus and other abstract machines (like Turing machine and Markov algorithm)

If we look on abstract machines we could noticed analogue with modern computers (of course). What I mean? I mean this points: 1. Model of implementer (In Turing machine it is description of head, ...
barammba's user avatar
16 votes
2 answers

Recent TCS publications with philosophical aspects

Many computer science publications from the 1950s and 1960s contain fascinating philosophical speculations on the nature of the mind and the meaning of information in relation to the physical world. ...
user36322's user avatar
  • 161
6 votes
2 answers

Which factors make the problem of inferring the grammar difficult?

Scott Aaronson said in the paper entitled "Why Philosophers Should Care About Computational Complexity" (Please see ECCC Report: TR11-108, section 7, pp 25-31): Following the work of Kearns and ...
Pigmann's user avatar
  • 159
11 votes
0 answers

Is Bayesian updating computationally unfeasible?

Bayesian theory is a very popular theory of probabilities based upon a subjective framework of beliefs. However, subjects and beliefs have to be embodied, meaning to be feasible, it ought to be ...
Timmy's user avatar
  • 261
18 votes
2 answers

Computation beyond unitary matrices

Just out of curiosity, if the classical computation is about permutation matrices and quantum computing is about unitary matrices (of which the permutation matrices are a subgroup), then will there be ...
huyichen's user avatar
  • 361
10 votes
1 answer

Convexity and efficient algorithms.

[Edit 21 July 2011: I edited the question to ask for more examples] This question is asking for documented discussion of or more examples of a heuristic observation. Some mathematical problems that ...
Vijay D's user avatar
  • 12.6k