How Complex is to Solve a Hard Problem with Accepting Splicing Systems

This chapter uses thought experiments and practical examples to introduce, in a very accessible way, the hard problem of consciousness. Soon, machines may behave like us to pass the Turing test and scientists may succeed in copying and simulating the inner workings of the brain. Will all this take us any closer to solving the mysteries of consciousness? The reader is taken to meet different kind of zombies, the philosophical, the digital, and the inner ones, to understand why many, scientists and philosophers alike, doubt that the mind–body problem will ever be solved.

Download Full-text

Decision Processes and Value Endogeneity

10.1093/oso/9780198825067.003.0004 ◽

2018 ◽

Author(s):

James G. March

Keyword(s):

Decision Processes ◽

Hard Problem ◽

Trade Offs ◽

Definition Of ◽

Over Time ◽

What Matters

Humans use reasons to shape and justify choices. In the process, trade-offs seem essential and often inevitable. But trade-offs involve comparisons, which are problematic both across values and especially over time. Reducing disparate values to a common metric (especially if that metric is money) is often problematic and unsatisfactory. Critically, it is not that values just shape choices, but that choices themselves shape values. This endogeneity of values makes an unconditional normative endorsement of modern decision-theoretic rationality unwise. This is a hard problem and there is no escaping the definition of good values, that is, those that make humans better. This removes the wall between economics and philosophy. If we are to adopt and enact this perspective, then greater discourse and debate on what matters and not just what counts will be useful and even indispensable.

Download Full-text

Zero Queueing for Multi-Server Jobs

Proceedings of the ACM on Measurement and Analysis of Computing Systems ◽

10.1145/3447385 ◽

2021 ◽

Vol 5 (1) ◽

pp. 1-25

Author(s):

Weina Wang ◽

Qiaomin Xie ◽

Mor Harchol-Balter

Keyword(s):

Cloud Computing ◽

Stability Region ◽

Transient Analysis ◽

Queueing Systems ◽

Sufficient Conditions ◽

Hard Problem ◽

Queueing Model ◽

Multiple Servers ◽

First Results ◽

Multi Server

Cloud computing today is dominated by multi-server jobs. These are jobs that request multiple servers simultaneously and hold onto all of these servers for the duration of the job. Multi-server jobs add a lot of complexity to the traditional one-server-per-job model: an arrival might not "fit'' into the available servers and might have to queue, blocking later arrivals and leaving servers idle. From a queueing perspective, almost nothing is understood about multi-server job queueing systems; even understanding the exact stability region is a very hard problem. In this paper, we investigate a multi-server job queueing model under scaling regimes where the number of servers in the system grows. Specifically, we consider a system with multiple classes of jobs, where jobs from different classes can request different numbers of servers and have different service time distributions, and jobs are served in first-come-first-served order. The multi-server job model opens up new scaling regimes where both the number of servers that a job needs and the system load scale with the total number of servers. Within these scaling regimes, we derive the first results on stability, queueing probability, and the transient analysis of the number of jobs in the system for each class. In particular we derive sufficient conditions for zero queueing. Our analysis introduces a novel way of extracting information from the Lyapunov drift, which can be applicable to a broader scope of problems in queueing systems.

Download Full-text

Teleosemantics and the hard problem of content

Philosophical Psychology ◽

10.1080/09515089.2021.1942814 ◽

2021 ◽

pp. 1-25

Author(s):

Stephen Francis Mann ◽

Ross Pain

Keyword(s):

Hard Problem ◽

The Hard Problem ◽

Hard Problem Of Content

Download Full-text

A trade-off between classical and quantum circuit size for an attack against CSIDH

Journal of Mathematical Cryptology ◽

10.1515/jmc-2020-0070 ◽

2020 ◽

Vol 15 (1) ◽

pp. 4-17

Author(s):

Jean-François Biasse ◽

Xavier Bonnetain ◽

Benjamin Pring ◽

André Schrottenloher ◽

William Youmans

Keyword(s):

Endomorphism Ring ◽

State Of The Art ◽

Quantum Circuit ◽

List Type ◽

Hard Problem ◽

Trade Off ◽

Classical State ◽

Security Parameter ◽

The Cost ◽

Quadratic Order

AbstractWe propose a heuristic algorithm to solve the underlying hard problem of the CSIDH cryptosystem (and other isogeny-based cryptosystems using elliptic curves with endomorphism ring isomorphic to an imaginary quadratic order 𝒪). Let Δ = Disc(𝒪) (in CSIDH, Δ = −4p for p the security parameter). Let 0 < α < 1/2, our algorithm requires:A classical circuit of size $2^{\tilde{O}\left(\log(|\Delta|)^{1-\alpha}\right)}.$A quantum circuit of size $2^{\tilde{O}\left(\log(|\Delta|)^{\alpha}\right)}.$Polynomial classical and quantum memory.Essentially, we propose to reduce the size of the quantum circuit below the state-of-the-art complexity $2^{\tilde{O}\left(\log(|\Delta|)^{1/2}\right)}$ at the cost of increasing the classical circuit-size required. The required classical circuit remains subexponential, which is a superpolynomial improvement over the classical state-of-the-art exponential solutions to these problems. Our method requires polynomial memory, both classical and quantum.

Download Full-text

Bounds of Fractional Metric Dimension and Applications with Grid-Related Networks

Mathematics ◽

10.3390/math9121383 ◽

2021 ◽

Vol 9 (12) ◽

pp. 1383

Author(s):

Ali H. Alkhaldi ◽

Muhammad Kamran Aslam ◽

Muhammad Javaid ◽

Abdulaziz Mohammed Alanazi

Keyword(s):

Metric Dimension ◽

Hard Problem ◽

Np Hard ◽

Weighted Version ◽

Sharp Bounds ◽

Np Hard Problem ◽

Metric Dimensions

Metric dimension of networks is a distance based parameter that is used to rectify the distance related problems in robotics, navigation and chemical strata. The fractional metric dimension is the latest developed weighted version of metric dimension and a generalization of the concept of local fractional metric dimension. Computing the fractional metric dimension for all the connected networks is an NP-hard problem. In this note, we find the sharp bounds of the fractional metric dimensions of all the connected networks under certain conditions. Moreover, we have calculated the fractional metric dimension of grid-like networks, called triangular and polaroid grids, with the aid of the aforementioned criteria. Moreover, we analyse the bounded and unboundedness of the fractional metric dimensions of the aforesaid networks with the help of 2D as well as 3D plots.

Download Full-text

Offline Algorithms in Low-Frequency Trading

Queue ◽

10.1145/3442632.3448307 ◽

2020 ◽

Vol 18 (6) ◽

pp. 37-51

Author(s):

Terence Kelly

Keyword(s):

Real Time ◽

Real World ◽

High Frequency ◽

Low Frequency ◽

Combinatorial Auctions ◽

Hard Problem ◽

Np Hard ◽

High Stakes ◽

Drill Bits ◽

Np Hard Problem

Expectations run high for software that makes real-world decisions, particularly when money hangs in the balance. This third episode of the Drill Bits column shows how well-designed software can effectively create wealth by optimizing gains from trade in combinatorial auctions. We'll unveil a deep connection between auctions and a classic textbook problem, we'll see that clearing an auction resembles a high-stakes mutant Tetris, we'll learn to stop worrying and love an NP-hard problem that's far from intractable in practice, and we'll contrast the deliberative business of combinatorial auctions with the near-real-time hustle of high-frequency trading. The example software that accompanies this installment of Drill Bits implements two algorithms that clear combinatorial auctions.

Download Full-text