Example of a question that could not be answered with a binary message

Before answering this question let me explain something in order to better understand how computers think. So, we can start with the simplest version of a computer: the Turing machine. A Turing machine isn't really a machine but a model for describing how computers do what they do.

This model was invented by computer scientist Alan Turing considered for many people to be the father of digital computing. Turing realized that all computational problems can be broken down into a very simple language, a digital language: 0 and 1 (binary code). That is very simple. One way to think about Turing's insight is in terms of two states like:

on and off

true and false

in and out

yes and no

Computer understand this language but what if we want to write a question that couldn't be answered with a binary message? The examples are as follows:

Questions or interrogative: "What is your name?"

Commands or imperative: "Close to your room"

Exclamations or exclamatory: "Wh!"

Performatives: I promise

Declaratives: Carbon is an element

Only declaratives qualify as statements because these are the only types of sentences that make a claim that something is true and this is what is important in logic. The rest of the questions are example of questions that couldn't be answered with a binary message.

ιт ιѕ ωнєи ѕσмєσиє ρυтѕ ιи α ¢σ∂є σя ѕσмєтнιиg тнαт вяιиgѕ α νιяυѕ, σя мєѕѕєѕ уσυя gαмє υρ, σя αℓℓσωѕ тнєм тσ ¢нєαт.

αи∂ уєѕ ι нανє вєєи нα¢кє∂ вєfσяє(ιт αιит fυи)

нσρє ι ¢συℓ∂ нєℓρ уσυ.