tcs Tag Posts Index

The CRINGE SHOW, Episode 9

The CRINGE SHOW, Episode 8

The CRINGE SHOW, Episode 7

The CRINGE SHOW, Episode 5

The CRINGE SHOW, Episode 4

Pink shows her preferences. Blue tries to score.

Existence properties for first-order number theory are all finitely checkable

OK, that's a mouthful. I wrote an answer to How can I show that a function is not computable over at Quora, which brought up the Busy Beaver function. BB(n) is a

TCS gifts wristwatches to its workers, they don’t like it. Want jewellery, home instead - Business News

Employee of tcs the biggest IT Firm are disappointed from the gifts they have got at 50th year celebration of the company. Source of shared Link

TCS Walk Quarter Benefit At Rs. 8,126 Crore, Beats Examiners' Appraisals

Tata Consultancy Services (TCS) on Friday reported a net profit of Rs. 8,126 crore for the quarter ended March 31, 2019, beating analysts' estimates. That marked

TCS to drive blockchain technology

TCS to drive blockchain reception 1 min read . 14 Mar 2019 IANS The new TCS arrangements will utilize Microsoft Azure Blockchain Cloud TCS has been effectively conveying

What does the AC0 complexity class mean?

AC^0 is a circuit complexity class. It represents the set of decision problems that are solvable with a family of constant-depth unlimited-fanin polynomial-size

Generalized Chess is PSPACE-Complete

The paper "On the complexity of chess" by James A Storer is available online, and it’s fairly readable. It demonstrates that deciding the winner in chess

What makes any NP-complete problem also a PSPACE problem?

For any f(n), DTIME(f(n)) ⊆ SPACE(f(n)). This is because if you run for f(n) steps you can write to at most f(n) locations. (The reverse, of course, is not true.)

An impractical reduction: factoring->3SAT->SUBSETSUM

The Subset Sum problem is NP-complete, but what does a reduction from another problem actually look like? I set out to create a concrete example. Let's start with

Integers with low Kolmogorov complexity

I found this cute sequence in the Online Encyclopedia of Integer Sequences: A168650: Integers that can be generated with a C/C++ expression that is shorter than

Two Proofs of the Undecidability of the Halting Problem

The Halting Problem is whether or not a given Turing machine halts on a given input. This is the classic example of an undecidable problem, one that no Turing machine

Asymptotic Bounds You May Not Have Learned In School

Computer Science education teaches "Big O" notation for describing complexity upper bounds, and Big-Theta and Big-Omega get introduced as well. Mathematicians

Lower bounds on time complexity

I'm (slowly) continuing to read The Computational Complexity of Logical Theories, and it came in useful answering this Quora question: Can we predict [time] complexity

Leonid Levin's Universal Algorithm

There's an algorithm which solves SAT instances in polynomial time, if and only if P=NP. If P=NP, then it runs in polynomial time. If P is not equal to NP, it runs

The Computational Complexity of Some Logical Theories

I'm reading a book from 1979 by Jeanne Ferrante and Charles W. Rackoff: "The Computational Complexity of Logical Theories." Though it's now nearly 40 years

This set of equations is a computer.

Hilbert's Tenth Problem from his famous list published in 1900, asks whether it is possible to create an algorithm which solves every Diophantine equation, that