Computation, numbers and structures

Alan Turing: we are not interested in the fact that the brain has the consistency of cold porridge… we can only see a short distance ahead, but we can see plenty there that needs to be done (on computation)

The classes and boundaries of automation

On Computability 2 – In continuation of the previous ‘On Computability’-papers, we proceed in exploring questions like: ‘What is computability?’, ‘Where do the exact boundaries of decidability lie?’, ‘Can the complexity classes be distinctly separated?’ and present responses provided by various pioneering scientists in the field through their lemmas and theorems over the last 90 …

The classes and boundaries of automation Read More »

Austere rules

On Computability 1B – In this document, we aim to further investigate the possible syntax of the Voynich Manuscript (VMS) by completing words containing glyphs for which we have evaluated possible mappings through previous statistical analysis. Our goal is to construct meaningful words and sentences in the plaintext. Our analysis primarily focuses on folio 57v, …

Austere rules Read More »

Syntax of a substitution cipher

On Computability 1A – In this document, we continue to deal with the topic of constraint satisfaction, which we use for pattern matching processing. In particular, we exemplarily examine the syntax of the Voynich Manuscript (VMS) to determine the most probable substitutions for the prevalent glyph patterns used in the script, assuming that the script …

Syntax of a substitution cipher Read More »

Worth of constraints

On Computability 1 – AI is increasingly capable to simulate human behaviour and reasoning in different areas. The Turing test (“imitation game” as of 1950s) proposes the interrogation of the machine intelligence by answers to written questions and the assessment if the given answers are generated by a human or a machine. Are the machine …

Worth of constraints Read More »