Skip to Content
You are currently on the new version of our website. Access the old version .

10 Results Found

  • Article
  • Open Access
1 Citations
2,868 Views
18 Pages

How Hard Is It to Detect Surveillance? A Formal Study of Panopticons and Their Detectability Problem

  • Vasiliki Liagkou,
  • Panayotis E. Nastou,
  • Paul Spirakis and
  • Yannis C. Stamatiou

The Panopticon (which means “watcher of everything”) is a well-known prison structure of continuous surveillance and discipline studied by Bentham in 1785. Today, where persistent, massive scale, surveillance is immensely facilitated by n...

(This article belongs to the Special Issue Cyber Security, Cryptology and Machine Learning)
  • Feature Paper
  • Article
  • Open Access
3 Citations
3,472 Views
9 Pages

Neutrosophic Computability and Enumeration

  • Ahmet Çevik,
  • Selçuk Topal and
  • Florentin Smarandache

16 November 2018

We introduce oracle Turing machines with neutrosophic values allowed in the oracle information and then give some results when one is permitted to use neutrosophic sets and logic in relative computation. We also introduce a method to enumerate the el...

(This article belongs to the Special Issue Algebraic Structures of Neutrosophic Triplets, Neutrosophic Duplets, or Neutrosophic Multisets)
  • Article
  • Open Access
2,540 Views
15 Pages

13 November 2021

In this paper we propose and analyse from the computational complexity point of view several new variants of nondeterministic Turing machines. In the first such variant, a machine accepts a given input word if and only if one of its shortest possible...

(This article belongs to the Special Issue In Memoriam, Solomon Marcus)
  • Proceeding Paper
  • Open Access
3,202 Views
5 Pages

In the physical world, computing processes, message communication networks and cognitive apparatuses are the building blocks of sentient beings. Genes and neural networks provide complementary information processing models that enable execution of me...

(This article belongs to the Proceedings of IS4SI 2019 Summit)
  • Proceeding Paper
  • Open Access
1 Citations
2,015 Views
5 Pages

This paper describes a new approach to autonomic computing that brings self-managing properties to applications and workflows of applications using a new computing model inspired by the functioning of the Turing Oracle Machine discussed in Alan Turin...

(This article belongs to the Proceedings of Proceedings of the IS4SI 2017 Summit DIGITALISATION FOR A SUSTAINABLE SOCIETY, Gothenburg, Sweden, 12–16 June 2017.)
  • Feature Paper
  • Article
  • Open Access
1,194 Views
6 Pages

7 January 2026

Kolmogorov complexity asks whether a string can be outputted by a Turing Machine (TM) whose description is shorter. Analogously, a real number is considered computable if a Turing machine can generate its decimal expansion. The modern ϵ-approxi...

(This article belongs to the Special Issue Kolmogorov Complexity and Applications—Dedicated to Professor Paul Vitanyi on the Occasion of His 80th Birthday)
  • Article
  • Open Access
1 Citations
4,806 Views
18 Pages

Metacomputable

  • Piotr Bołtuć

22 November 2017

The paper introduces the notion of “metacomputable” processes as those which are the product of computable processes. This notion seems interesting in the instance when metacomputable processes may not be computable themselves, but are produced by co...

(This article belongs to the Special Issue Information-Processing and Embodied, Embedded, Enactive Cognition Part 1)
  • Article
  • Open Access
3 Citations
6,639 Views
12 Pages

With 500+ papers and 20+ books spanning many scientific disciplines, Mark Burgin has left an indelible mark and legacy for future explorers of human thought and information technology professionals. In this paper, I discuss his contribution to the ev...

(This article belongs to the Special Issue Special Issue in Memory of Professor Mark Burgin)
  • Feature Paper
  • Article
  • Open Access
2 Citations
686 Views
24 Pages

28 February 2026

We analyze the power of the recently proposed Lorentz quantum computer (LQC), a theoretical model leveraging hyperbolic bits (hybits) governed by complex Lorentz transformations. We define the complexity class BLQP (bounded-error Lorentz quantum poly...

(This article belongs to the Special Issue Quantum Computation, Quantum AI, and Quantum Information)