Unverified50% confidenceFactExact time
Computational depth was proposed by Charles Bennett and is defined as the minimum parallel computation time (or work) required to generate the object from a near-shortest description.
1
Sources
50%
Confidence
Long-term
Relevance
10/30/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedMonocular depth estimation outputs relative depth rather than absolute metric depth, which is an inherent limitation of this technical approach.70% similarUnverified卡尔·纽波特在《深度工作》一书中提出，能够进行长时间不受干扰的深度工作是一种日益稀缺且极具价值的能力64% similarUnverifiedAn operator is the smallest computational unit in a deep learning framework that performs specific mathematical operations, such as matrix multiplication, attention computation, and normalization.62% similarUnverifiedMetric depth refers to depth values expressed in real physical units (such as meters), rather than relative depth or disparity.62% similarUnverifiedCircuit depth refers to the length of the longest gate sequence from input to output, while the total number of gate operations reflects overall complexity; together the two determine whether an algorithm is feasible on NISQ devices.61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1114160API
curl https://kongchang.com/api/v1/knowledge/claims/1114160MCP
get_claim(id=1114160)